A backbone-search heuristic for efficient solving of hard 3-SAT formulae

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 248-253

  Dubois, Olivier ^a   Dequen, Gilles ^b  

^a CNRS   (France)

^b UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC SEARCH; PERFORMANCE IMPROVEMENTS; RANDOM K-SAT; SATISFIABILITY; TRUTH VALUES;

ARTIFICIAL INTELLIGENCE;

HEURISTIC ALGORITHMS;

EID: 84880858736     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. R. Bayardo and R. Schrag. Using CSP look-back techniques to solve real-world SAT instances. In Proc. of the 14th Nat. Conf. on Artificial Intelligence, pages 203-208. AAAI, 1996.
2. B. Bollobás, C. Borgs, J. T. Chayes, J. H. Kim, and D. B. Wilson. The scaling window of the 2-SAT transition. Random Structures and Algorithms, 2000.
3. Y. Boufkhad and O. Dubois. Length of prime implicants and number of solutions of random CNF formulae. Theoretical Computer Science, 215 (1-2):1-30, 1999. (Pubitemid 129608911)
4. J. M. Crawford and L. D. Auton. Experimental results on the crossover point in satisfiability problems. In Proc. of the 11th Nat. Conf. on Artificial Intelligence, pages 21-27. AAAI, 1993.
5. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Comm. Assoc. for Comput. Mach., (5):394-397, 1962.
6. O. Dubois, P. Andre, Y. Boufkhad, and J. Carlier. SAT versus UNSAT. DIMACS Series in Discrete Math. and Theoret. Comp. Sc., pages 415-436, 1996.
7. J. W. Freeman. Hard random 3-SAT problems and the Davis-Putnam procedure. Artificial Intelligence, 81(1-2):183-198, 1996.
8. M. R. Garey and D. S. Johnson. Computers and Intractability / A Guide to the Theory of NP-Completeness. W.H. Freeman & Company, San Francisco, 1979.
9. I. P. Gent and T. Walsh. The SAT phase transition. In Proc. of the 11th European Conf. on Artificial Intelligence, pages 105-109. ECAI, 1994.
10. C. M. Li and S. Gerard. On the limit of branching rules for hard random unsatisfiable 3-SAT. In Proc. of European Conf. on Artificial Intelligence, pages 98-102. ECAI, 2000.
11. C. M. Li. A constraint-based approach to narrow search trees for satisfiability. Information Processing Letters, 71(2):75-80, 1999.
12. D. Mitchell, B. Selman, and H. J. Levesque. Hard and easy distribution of SAT problems. In Proc. 10th Nat. Conf. on Artificial Intelligence. AAAI, 1992.
13. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity from characteristic 'phase transitions'. Nature 400, pages 133-137, 1999. (Pubitemid 29327535)
14. B. Selman, H. Kautz, and D. McAllester. Ten challenges in propositional reasoning and search. In Proc. of IJCAI-97, 1997.
15. H. Zhang. SATO. an efficient propositional prover. In Proc. of the 14th Internat. Conf. on Automated Deduction, pages 272-275. CADE-97, LNCS, 1997.