Exploiting the real power of unit propagation lookahead

Abstract Abstract One of the best SAT solvers for random 3-SAT formulae, SATZ, is based on a heuristic called unit propagation lookahead (UPL). Unfortunately, it does not perform so well on specific structured instances, especially on the ones coming from an area where a huge interest for SAT has emerged in recent years: symbolic model checking (SMC). We claim that all the power of this heuristic is not used in SATZ, and that UPL can be extended to solve some real world structured problems, where the major competitors are using intelligent backtracking or specific deduction rules. We introduce a preprocessing technique that can be applied to simplify instances containing equivalent literals. This technique is based on UPL, so it can be easily added to any solver using this heuristic. We compare our approach to the new extension of SATZ for equivalency reasoning (EqSATZ) and another approach, the Stalmarck method, which is mainly used in SMC. The author would like to thank Yacine Boufkhad for his insights about C-SAT and 2-simplify, Mamoun Filali-Amine for pointing out the Stalmark method, Chu-Min Li for his discussions about EqSATZ and his implementation of the implied literal propagation in SATZ, Laurent Simon for his SAT-Ex web site, Miroslav Velev for his remarks on the early version of the paper and the referees for their helpful comments. This research was funded by an ARC Large Grant at The University of Newcastle.

[1]  Gilles Audemard,et al.  AVAL: An Enumerative Method for SAT , 2000, Computational Logic.

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

[3]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[4]  Philippe Chatalic,et al.  SatEx: A Web-based Framework for SAT Experimentation , 2001, Electron. Notes Discret. Math..

[5]  Bart Selman,et al.  Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.

[6]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[7]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[8]  Chu Min Li,et al.  Integrating Equivalency Reasoning into Davis-Putnam Procedure , 2000, AAAI/IAAI.

[9]  Jacques Carlier,et al.  SAT versus UNSAT , 1993, Cliques, Coloring, and Satisfiability.

[10]  Hantao Zhang,et al.  SATO: An Efficient Propositional Prover , 1997, CADE.

[11]  Hans van Maaren,et al.  A two phase algorithm for solving a class of hard satissfiability problems , 1998 .

[12]  Chu Min Li,et al.  A Constraint-Based Approach to Narrow Search Trees for Satisfiability , 1999, Inf. Process. Lett..

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

[14]  Joao Marques-Silva,et al.  Combinational equivalence checking using satisfiability and recursive learning , 1999, Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078).

[15]  Armando Tacchella,et al.  Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability , 2001, IJCAR.

[16]  Karem A. Sakallah,et al.  GRASP—a new search algorithm for satisfiability , 1996, ICCAD 1996.

[17]  J. Freeman.  Improvements to propositional satisfiability search algorithms , 1995 .

[18]  Joao Marques-Silva.  Algebraic Simplification Techniques for Propositional Satisfiability , 2000, CP.

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

[20]  Chu Min Li,et al.  Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.

[21]  Gil Utard,et al.  Parallelizing Satz Using Dynamic Workload Balancing , 2001, Electron. Notes Discret. Math..

[22]  Hans van Maaren,et al.  Sat2000: Highlights of Satisfiability Research in the Year 2000 , 2000 .

[23]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[24]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

[25]  Bart Selman,et al.  Ten Challenges in Propositional Reasoning and Search , 1997, IJCAI.

[26]  K. Sakallah,et al.  A New Search Algorithm for Satisfiability , 1996 .

[27]  Alan Smaill,et al.  Backbone Fragility and the Local Search Cost Peak , 2000, J. Artif. Intell. Res..