Effective incorporation of double look-ahead procedures

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

Volumn 4501 LNCS, Issue , 2007, Pages 258-271

  Heule, Marijn ^a   Van Maaren, Hans ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; HEURISTIC ALGORITHMS; OPTIMAL SYSTEMS; PROBLEM SOLVING;

STATIC HEURISTICS; STATIC SETTINGS;

ADAPTIVE ALGORITHMS;

EID: 38049173439     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72788-0_25     Document Type: Conference Paper

References (11)

1. A. Biere, A. Cimatti, E.M. Clarke, Y. Zhu, Symbolic model checking without BDDs. in Proc. Int. Conf. TACAS, Springer Verlag, LNCS 1579 (1999), 193-207.
2. H. Connamacher, A random constraint satisfaction problem that seems hard for DPLL. In the Proceedings of SAT 2004.
3. M. Davis, G. Logemann, and D. Loveland, A machine program for theorem proving. Communications of the ACM 5 (1962), 394-397.
4. O. Dubois and G. Dequen, source code of the kcnfs solver. Available at http://www.laria.u-picardie.fr/~dequen/sat/.
5. J.W. Freeman, Improvements to Propositional Satisfiability Search Algorithms. Ph.D. thesis, University of Pennsylvania, Philadelphia (1995).
6. D. Le Berre and L. Simon, The essentials of the SAT'03 Competition. Springer-Verlag, LNCS 2919 (2004), 452-467.
7. C.M. Li, A constraint-based approach to narrow search trees for satisfiability. Information processing letters 71 (1999), 75-80.
8. C.M. Li and Anbulagan. Heuristics Based on Unit Propagation for Satisfiability Problems. In Proc. of Fifteenth IJCAI (1997), 366-371.
9. L. Simon, D. Le Berre, and E. Hirsch, The SAT 2002 competition. Annals of Mathematics and Artificial Intelligence (AMAI) 43 (2005), 343-378.
10. L. Simon, Sat'04 competition homepage. http://www.satcompetition. org/2004
11. H. Zhang and M.E. Stickel, Implementing the Davis-Putnam Method. SAT2000 (2000), 309-326.