A constraint-based approach to narrow search trees for satisfiability

Information Processing Letters

Volumn 71, Issue 2, 1999, Pages 75-80

  Li, Chu Min ^a  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

Automatic theorem proving; Computational complexity; DP procedure; SAT

Indexed keywords

EID: 0042796575     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(99)00088-5     Document Type: Article

References (9)

1. J.M. Crawford, L.D. Auton, Experimental results on the crossover point in random 3-SAT, Artificial Intelligence 81 (1996) 31-57.
2. M. Davis, G. Logemann, D. Loveland, A machine program for theorem proving, Comm. ACM 5 (1962) 394-397.
3. O. Dubois, P. Andre, Y. Boufkhad, J. Carlier, SAT versus UNSAT, in: Second DIMACS Challenge: Cliques, Coloring and Satisfiability (Rutgers University, NJ, 1993).
4. J.W. Freeman, Improvements to prepositional satisfiability search algorithms, Ph.D. Thesis, University of Pennsylvania, Philadelphia, PA, 1995.
5. C.P. Gomes, B. Selman, H. Kautz, Boosting combinatorial search through randomization, in: Proceedings AAAI-98, Madison, WI, 1998.
6. J.N. Hooker, V. Vinay, Branching rules for satisfiability, J. Automated Reasoning 15 (1995) 359-383.
7. C.M. Li, Anbulagan, Heuristics based on unit propagation for satisfiability problems, in: Proc. IJCAI-97, Nagoya, Japan, August 1997, pp. 366-371.
8. C.M. Li, Anbulagan, Look-ahead versus look-back for satisfiability problems, in: Proc. CP-97, Lecture Notes in Computer Sci. 1330, Springer, Austria, 1997, pp. 342-356.
9. D. Mitchell, B. Selman, H. Levesque, Hard and easy distributions of SAT problems, in: Proc. 10th National Conference on Artificial Intelligence (AAAI-92), San Jose, CA, July 1992, pp. 459-465.