Kcnfs: An efficient solver for random k-SAT formulae

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

Volumn 2919, Issue , 2004, Pages 486-501

  Dequen, Gilles ^a   Dubois, Olivier ^b  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

DPLL ALGORITHM; EFFICIENT SOLVERS; RANDOM K-SAT; RANDOM K-SAT FORMULAS;

HEURISTIC PROGRAMMING;

EID: 33644911338     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24605-3_36     Document Type: Article

References (16)

1. Dubois, O., Dequen, G.: A Backbone Search Heuristic for Efficient Solving of Hard 3-SAT Formulae. In: Proc. of the 17th Internat. Joint Conf. on Artificial Intelligence, Seattle (2001) 248-253
2. Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining Computational Complexity from Characteristic 'Phase Transitions'. Nature 400 (1999) 133-137
3. Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal Association for Computing Machine (1960) 201-215
4. Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem-Proving. Journal Association for Computing Machine (1962) 394-397
5. Li, C.M., Anbulagan: Heuristics Based on Unit Propagation for Satisfiability Problems. In: Proc. of the 15th Internat. Joint Conf. on Artificial Intelligence, Nagoya (Japan), IJCAI (1997) 366-371
6. Freeman, J.W.: Hard Random 3-SAT Problems and the Davis-Putnam Procedure. Artificial Intelligence 81 (1996) 183-198
7. Dubois, O., Andre, P., Boufkhad, Y., Carlier, J.: SAT versus UNSAT. DIMACS Series in Discr. Math, and Theor. Computer Science (1993) 415-436
8. Li, C.M.: A Constraint-Based Approach to Narrow Search Trees for Satisfiability. Information Processing Letters 71 (1999) 75-80
9. Kullman, O.: Heuristics for SAT algorithms: A systematic study. In: Extended abstract for the Second workshop on the satisfiability problem (SAT'98). (1998)
10. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proceedings of the 38th Design Automation Conference (DAC'01). (2001)
11. Zhang, H.: SATO. An Efficient Prepositional Prover. In: Proc. of the 14th Internat. Conf. on Automated Deduction, CADE-97, LNCS (1997) 272-275
12. Selman, B., Kautz, H.A., Cohen, B.: Noise Strategies for Improving Local Search. In: Proc. of the 12th National Conf. on Artificial Intelligence. Volume 1, Menlo Park, CA, USA, AAAI Press (1994) 337-343
13. A. Braunstein, M. Mezard, R.Z.: Survey propagation: an algorithm for satisfiability. arXiv - cond-mat/0207194 (2002)
14. Li, C.M., Gerard, S.: On the Limit of Branching Rules for Hard Random Unsatisfiable 3-SAT. In: Proc. of European Conf. on Artificial Intelligence, ECAI (2000) 98-102
15. G. Biroli, R. Monasson, M.W.: A variational description of the ground state structure in random satisfiability problems. Eur. Phys. J. B 14 551 (2000)
16. M. Mezard, G. Parisi, R.Z.: Analytic and algorithmic solutions of random satisfiability problems. Science 297 (2002)