Effective Preprocessing in SAT Through Variable and Clause Elimination

Preprocessing SAT instances can reduce their size considerably. We combine variable elimination with subsumption and self-subsuming resolution, and show that these techniques not only shrink the formula further than previous preprocessing efforts based on variable elimination, but also decrease runtime of SAT solvers substantially for typical industrial SAT problems. We discuss critical implementation details that make the reduction procedure fast enough to be practical.

[1]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[2]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

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

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

[5]  Dhiraj K. Pradhan,et al.  Recursive Learning: An attractive alternative to the decision tree for test generation in digital ci , 1992, Proceedings International Test Conference 1992.

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

[7]  Philippe Chatalic,et al.  ZRES: The Old Davis-Putman Procedure Meets ZBDD , 2000, CADE.

[8]  Armando Tacchella,et al.  Dependent and Independent Variables in Propositional Satisfiability , 2002, JELIA.

[9]  Malay K. Ganai,et al.  Robust Boolean reasoning for equivalence checking and functional property verification , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Lakhdar Sais,et al.  Recovering and Exploiting Structural Knowledge from CNF Formulas , 2002, CP.

[11]  Yakov Novikov.  Local search for Boolean relations on the basis of unit propagation , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[12]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[13]  Niklas Sörensson,et al.  Temporal induction by incremental SAT solving , 2003, BMC@CAV.

[14]  Inês Lynce,et al.  Probing-based preprocessing techniques for propositional satisfiability , 2003, Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence.

[15]  Fahiem Bacchus,et al.  Effective Preprocessing with Hyper-Resolution and Equality Reduction , 2003, SAT.

[16]  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).

[17]  Efficient translation of boolean formulas to CNF in formal verification of microprocessors , 2004 .

[18]  Lakhdar Sais,et al.  Automatic Extraction of Functional Dependencies , 2004, SAT.

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

[20]  Armin Biere,et al.  Resolve and Expand , 2004, SAT.

[21]  Dhiraj K. Pradhan,et al.  NiVER: Non Increasing Variable Elimination Resolution for Preprocessing SAT instances , 2004, SAT.

[22]  Ronen I. Brafman,et al.  A simplifier for propositional formulas with many binary clauses , 2001, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).