Circuit Minimization with QBF-Based Exact Synthesis
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
2023年份
14被引次数
3顶会引用
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- SAT-based Decision Tree Learning for Large Data SetsAndré Schidler, Stefan SzeiderAAAI 2021 · 被引用 72 次
- SAT-Based Tree Decomposition with Iterative Cascading Policy SelectionHai Xia, Stefan SzeiderAAAI 2024 · 被引用 1 次
- Cirbo: A New Tool for Boolean Circuit Analysis and SynthesisDaniil Averkov, Tatiana Belova, Gregory Emdin, Mikhail Goncharov 等AAAI 2025
它引用的顶会 Paper2
相关 Paper
- Optimizing Quantum Circuits, Fast and SlowAmanda Xu, Abtin Molavi, Swamit Tannu, Aws AlbarghouthiASPLOS 2025 · 被引用 8 次
- Synthesis of Compact and Expressive Quantum-Circuit OptimizationsWei Qiang, Ronghui GuOOPSLA 2026
- Search space characterization for approximate logic synthesisLinus Witschen, Tobias Wiersema, Lucas Reuter, Marco PlatznerDAC 2022 · 被引用 3 次
- Interpolation-Based Semantic Gate Extraction and Its Applications to QBF PreprocessingFriedrich SlivovskyCAV 2020 · 被引用 10 次
- Equality Saturation for Quantum Circuit OptimizationGanxiang Yang, Paige Raun, Runzhou Tao, Ronghui GuPLDI 2026
