论文信息 - March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver

March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver

This paper discusses several techniques to make the look- ahead architecture for satisfiability (Sat) solvers more competitive. Our contribution consists of reduction of the computational costs to perform look-ahead and a cheap integration of both equivalence reasoning and local learning. Most proposed techniques are illustrated with experimental results of their implementation in our solver march_eq.

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

[2] Gert Smolka. Principles and Practice of Constraint Programming-CP97 , 1997, Lecture Notes in Computer Science.

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

[4] Chu Min Li,et al. Equivalent literal propagation in the DLL procedure , 2003, Discret. Appl. Math..

[5] Edward A. Hirsch,et al. The SAT2002 Competition , 2005 .

[6] Mark E. Stickel,et al. Implementing the Davis–Putnam Method , 2000, Journal of Automated Reasoning.

[7] Hans van Maaren,et al. Aligning CNF- and Equivalence-reasoning , 2004, SAT.

[8] Gilles Dequen,et al. A backbone-search heuristic for efficient solving of hard 3-SAT formulae , 2001, IJCAI.

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

[10] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[11] Laurent Simon,et al. The Essentials of the SAT 2003 Competition , 2003, SAT.

[12] Chu Min Li,et al. Look-Ahead Versus Look-Back for Satisfiability Problems , 1997, CP.

[13] Daniel Le Berre. Exploiting the real power of unit propagation lookahead , 2001, Electron. Notes Discret. Math..