March_eq: Implementing additional reasoning into an efficient look-ahead SAT solver

Lecture Notes in Computer Science

Volumn 3542, Issue , 2005, Pages 345-359

  Heule, Marijn ^a   Dufour, Mark ^a   Van Zwieten, Joris ^a   Van Maaren, Hans ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITION; COMPUTATIONAL METHODS; COSTS; INTEGRATION; LEARNING SYSTEMS; PROBLEM SOLVING;

COMPUTATIONAL COSTS; EQUIVALENCE REASONING; LOCAL LEARNING; LOOK-AHEAD SAT SOLVER;

COMPUTER ARCHITECTURE;

EID: 26444462478     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11527695_26     Document Type: Conference Paper

References (14)

1. D. Mitchel, B. Selmon and H. Levesque, Hard and easy distributions of SAT problems. Proceedings of AIII-1992 (1992), 459-465.
2. D. Le Berre, Exploiting the Real Power of Unit Propagation Lookahead, In LICS Workshop on Theory and Applications of Satisfiability Testing (2001).
3. D. Le Berre and L. Simon, The essentials of the SAT'03 Competition. Springer-Verlag, Lecture Notes in Comput. Sci. 2919 (2004), 452-467.
4. A. Biere, A. Cimatti, E.M. Clarke, Y. Zhu, Symbolic model checking without BDDs. in Proc. Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems, Springer-Verlag, Lecture Notes in Comput. Sci. 1579 (1999), 193-207.
5. M. Davis, G. Logemann, and D. Loveland, A machine program for theorem proving. Communications of the ACM 5 (1962), 394-397.
6. O. Dubois and G. Dequen, A backbone-search heuristic for efficient solving of hard3-sat formulae. International Joint Conference on Artificial Intelligence 2001 1 (2001), 248-253.
7. M.J.H. Heule and H. van Maaren, Aligning CNF- and Equivalence-Reasoning. Appearing in the same volume.
8. O. Kullmann, Investigating the behaviour of a SAT solver on random formulas. Submitted to Annals of Mathematics and Artificial Intelligence (2002).
9. C.M. Li and Anbulagan, Look-Ahead versus Look-Back for Satisfiability Problems. Springer-Verlag, Lecture Notes in Comput. Sci. 1330 (1997), 342-356.
10. C.M. Li, Equivalent literal propagation in the DLL procedure. The Renesse issue on satisfiability (2000). Discrete Appl. Math. 130 (2003), no. 2, 251-276.
11. L. Simon, Sat'04 competition homepage. http://www.lri.fr/~simon/contest/ results/
12. L. Simon, D. Le Berre, and E. Hirsch, The SAT 2002 competition. Accepted for publication in Annals of Mathematics and Artificial Intelligence (AMAI) 43 (2005), 343-378.
13. J.P. Warners, H. van Maaren, A two phase algorithm for solving a class of hard satisfiability problems. Oper. Res. Lett. 23 (1998), no. 3-5, 81-88.
14. H. Zhang and M.E. Stickel, Implementing the Davis-Putnam Method. SAT2000 (2000), 309-326.