(In)Effectiveness of look-ahead techniques in a modern SAT solver

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2833, Issue , 2003, Pages 842-846

  Giunchiglia, Enrico ^a   Maratea, Marco ^a   Tacchella, Armando ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; MODEL CHECKING;

DETECTION METHODS; LOOK AHEAD TECHNIQUE; PROPAGATION METHOD; SAT INSTANCES; SAT SOLVERS;

FORMAL LOGIC;

EID: 9444239028     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_64     Document Type: Article

References (8)

1. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Proc. of DAC, 2001.
2. L. Simon, D. Le Berre, and E. A. Hirsch. The SAT2002 Competition.
3. J. W. Freeman. Improvements to prepositional satisfiability search algorithms. PhD thesis, University of Pennsylvania, 1995.
4. C. M. Li and Anbulagan. Heuristics Based on Unit Propagation for Satisfiability Problems. In Proc. of IJCAI, pages 366-371. Morgan-Kauffmann, 1997.
5. R. J. Bayardo, Jr. and R. C. Schrag. Using CSP Look-Back Techniques to Solve Real-World SAT instances. In Proc. of AAAI, pages 203-208. AAAI Press, 1997.
6. F. Bacchus. Enhancing Davis Putnam with Extended Binary Clause Reasoning. In Proc. of AAAI. AAAI Press, 2001.
7. J. Gu, P. W. Purdom, J. Franco, and B. W. Wah. Algorithms for the Satisfiability (SAT) Problem: A Survey. In Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 19-153. AMS, 1997.
8. E. Giunchiglia, M. Maratea, and A. Tacchella. (In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver, 2003. Technical report available at http://www.mrg.dist.unige.it/~tac/Reports/failed.ps.