<div class="csl-bib-body">
<div class="csl-entry">Reichl, F.-X., Slivovsky, F., & Szeider, S. (2023). Circuit Minimization with QBF-Based Exact Synthesis. In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i> (pp. 4087–4094). AAAI Press. https://doi.org/10.1609/aaai.v37i4.25524</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/191381
-
dc.description.abstract
This paper presents a rewriting method for Boolean circuits that minimizes small subcircuits with exact synthesis. Individual synthesis tasks are encoded as Quantified Boolean Formulas (QBFs) that capture the full flexibility for implementing multi-output subcircuits. This is in contrast to SAT-based resynthesis, where "don't cares" are computed for an individual gate, and replacements are confined to the circuitry used exclusively by that gate. An implementation of our method achieved substantial size reductions compared to state-of-the-art methods across a wide range of benchmark circuits.
en
dc.language.iso
en
-
dc.rights.uri
http://rightsstatements.org/vocab/InC/1.0/
-
dc.subject
Satisfiability
en
dc.subject
APP: Design
en
dc.subject
Boolean circuits
en
dc.title
Circuit Minimization with QBF-Based Exact Synthesis