<div class="csl-bib-body">
<div class="csl-entry">Szeider, S. (2024, July 3). <i>Circuit Minimization with QBF and SAT-Based Exact Synthesis</i> [Presentation]. Synthesis of Models and Systems, California, United States of America (the).</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/207509
-
dc.description.abstract
In this talk, we will present new methods for re-synthesizing Boolean circuits for minimizing the number of gates. The proposed method rewrites small subcircuits with exact synthesis, where Individual synthesis tasks are encoded as Quantified Boolean Formulas (QBFs) or as SAT (propositional satisfiability) instances. A key aspect of this approach is how it handles "don't cares," which provides additional flexibility. A prototype implementation allowed us to break the record on the number of gates for some benchmark instances. Joint work with Franz-Xaver Reichl and Friedrich Slivovsky.
en
dc.language.iso
en
-
dc.subject
Circuit Minimization
en
dc.subject
Exact Synthesis
en
dc.subject
Quantified Boolean Formulas (QBF)
en
dc.subject
Satisfiability (SAT)
en
dc.title
Circuit Minimization with QBF and SAT-Based Exact Synthesis
en
dc.type
Presentation
en
dc.type
Vortrag
de
dc.type.category
Presentation
-
tuw.publication.invited
invited
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-01 - Forschungsbereich Algorithms and Complexity
-
tuw.publication.orgunit
E056-13 - Fachbereich LogiCS
-
tuw.publication.orgunit
E056-23 - Fachbereich Innovative Combinations and Applications of AI and ML (iCAIML)
-
tuw.author.orcid
0000-0001-8994-1656
-
tuw.event.name
Synthesis of Models and Systems
en
tuw.event.startdate
01-07-2024
-
tuw.event.enddate
05-07-2024
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
California
-
tuw.event.country
US
-
tuw.event.presenter
Szeider, Stefan
-
tuw.event.track
Single Track
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.grantfulltext
none
-
item.fulltext
no Fulltext
-
item.openairetype
conference presentation
-
item.languageiso639-1
en
-
item.cerifentitytype
Publications
-
item.openairecristype
http://purl.org/coar/resource_type/R60J-J5BD
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
