Circuit Minimization with QBF-Based Exact Synthesis

Authors

  • Franz-Xaver Reichl TU Wien
  • Friedrich Slivovsky TU Wien
  • Stefan Szeider TU Wien

DOI:

https://doi.org/10.1609/aaai.v37i4.25524

Keywords:

CSO: Satisfiability, APP: Design

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.

Downloads

Published

2023-06-26

How to Cite

Reichl, F.-X., Slivovsky, F., & Szeider, S. (2023). Circuit Minimization with QBF-Based Exact Synthesis. Proceedings of the AAAI Conference on Artificial Intelligence, 37(4), 4087-4094. https://doi.org/10.1609/aaai.v37i4.25524

Issue

Section

AAAI Technical Track on Constraint Satisfaction and Optimization