论文信息 - Efficient Circuit to CNF Conversion

Efficient Circuit to CNF Conversion

Modern SAT solvers are proficient at solving Boolean satisfiability problems in Conjunctive Normal Form (CNF). However, these problems mostly arise from general Boolean circuits that are then translated to CNF. We outline a simple and expressive data structure for describing arbitrary circuits, as well as an algorithm for converting circuits to CNF. Our experimental results over a large benchmark suite show that the CNF problems we generate are consistently smaller and more quickly solved by modern SAT solvers than the CNF problems generated by current CNF generation methods.

Panagiotis Manolios | Daron Vroon

[1] Armin Biere,et al. Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings , 2006, SAT.

[2] Paul B. Jackson,et al. Clause Form Conversions for Boolean Circuits , 2004, SAT (Selected Papers.

[3] Panagiotis Manolios,et al. Automatic memory reductions for RTL model verification , 2006, ICCAD.

[4] Panagiotis Manolios,et al. BAT: The Bit-Level Analysis Tool , 2007, CAV.

[5] Bruno Dutertre,et al. A Fast Linear-Arithmetic Solver for DPLL(T) , 2006, CAV.

[6] Albert Oliveras,et al. On SAT Modulo Theories and Optimization Problems , 2006, SAT.

[7] G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus , 1983 .

[9] Armin Biere,et al. Local Two-Level And-Inverter Graph Minimization without Blowup , 2006 .

[10] Armin Biere,et al. Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.