Faster SAT solving with better CNF generation

Boolean satisfiability (SAT) solving has become an enabling technology with wide-ranging applications in numerous disciplines. These applications tend to be most naturally encoded using arbitrary Boolean expressions, but to use modern SAT solvers, one has to generate expressions in conjunctive normal form (CNF). This process can significantly affect SAT solving times. In this paper, we introduce a new linear-time CNF generation algorithm. We have implemented our algorithm and have conducted extensive experiments, which show that our algorithm leads to faster SAT solving times and smaller CNF than existing approaches.

[1]  Andreas Kuehlmann.  Dynamic transition relation simplification for bounded property checking , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..

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

[3]  Panagiotis Manolios,et al.  Efficient Circuit to CNF Conversion , 2007, SAT.

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

[5]  A. Kuehlmann,et al.  Equivalence Checking Using Cuts And Heaps , 1997, Proceedings of the 34th Design Automation Conference.

[6]  Miroslav N. Velev,et al.  Efficient translation of Boolean formulas to CNF in formal verification of microprocessors , 2004, ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753).

[7]  Thierry Boy de la Tour.  An Optimality Result for Clause Form Translation , 1992, J. Symb. Comput..

[8]  Thierry Bajou,et al.  De La Tour , 1985 .

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

[10]  Parosh Aziz Abdulla,et al.  Symbolic Reachability Analysis Based on SAT-Solvers , 2000, TACAS.

[11]  Adnan Darwiche,et al.  RSat 2.0: SAT Solver Description , 2006 .

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

[13]  David A. Plaisted,et al.  A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..

[14]  Alan Mishchenko,et al.  Applying Logic Synthesis for Speeding Up SAT , 2007, SAT.

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