On the complexity of choosing the branching literal in DPLL

Artificial Intelligence

Volumn 116, Issue 1-2, 2000, Pages 315-326

  Liberatore, Paolo ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

DAVIS-PUTNAM-LOGEMANN-LOVELAND ALGORITHM; PROPOSITIONAL SATISFIABILITY;

ARTIFICIAL INTELLIGENCE;

EID: 0033895988     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00097-1     Document Type: Article

References (14)

1. 0-Frege proofs. Proc. FOCS-97. 1997;254-265.
2. Crawford J.M., Auton L.D. Experimental results on the crossover point in satisfiability problems. Proc. AAAI-93, Washington, DC. 1993;21-27.
3. Cook S., Reckhow R. On the length of proofs in the propositional calculus. Proc. STOC-74. 1974;135-148.
4. Dubois O., Andre P., Boufkhad Y., Carlier J. SAT versus UNSAT. Johnson D., Trick M. Second DIMACS Challenge: Cliques, Coloring, and Satisfiability. 1993;AMS, Providence, RI.
5. Davis M., Logemann G., Loveland D. A machine program for theorem proving. Comm. ACM. 5:(7):1962;394-397.
6. Davis M., Putnam H. A computing procedure for quantification theory. J. ACM. 7:1960;201-215.
7. Freeman J. Improvements to propositional satisfiability search algorithms, Ph.D. Thesis. 1995;University of Pennsylvania.
8. Hooker J.N., Vinay V. Branching rules for satisfiability. J. Automat. Reason. 15:(3):1995;383-395.
9. Jeroslow R.G., Wang J. Solving propositional satisfiability problems. Ann. Math. Artificial Intelligence. 1:1990;167-187.
10. Li C.M., Anbulagan Heuristics based on unit propagation for satisfiability problems. Proc. IJCAI-97, Nagoya, Japan. 1997;366-371.
11. Ouyang M. How good are branching rules in DPLL? Technical Report 96-38. 1996;DIMACS.
12. Selman B., Kautz H.A., Cohen B. Noise strategies for improving local search. Proc. AAAI-94, Seattle, WA. 1994;337-343.
13. Selman B., Levesque H., Mitchell D. A new method for solving hard satisfiability problems. Proc. AAAI-92, San Jose, CA. 1992;440-446.
14. Tseitin G. On the complexity of derivation in propositional calculus. Slisenko A. Studies in Constructive Mathematics and Mathematical Logic, Vol. II. 1970;115-125 Consultants Bureau.