Look-ahead versus look-back for satisfiability problems

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

Volumn 1330, Issue , 1997, Pages 341-355

  Li, Chu Min ^a   Anbulagan, ^a  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER PROGRAMMING; CONSTRAINT THEORY; FORMAL LOGIC;

3-SAT PROBLEMS; CONSISTENCY CHECKING; GENERAL CONSTRAINTS; LIMITED RESOLUTION; LOOK AHEAD TECHNIQUE; PROPOSITIONAL SATISFIABILITY; SATISFIABILITY PROBLEMS; UNIT PROPAGATION;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84948992651     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0017450     Document Type: Conference Paper

References (18)

1. Bayardo Jr. E.J., Schrag R.C., Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances, Proceedings of the Second International Conference on Principles and Practice of Constraint Programming (CP96), Cambridge, Massachusetts, USA, August 1996.
2. Bayardo Jr. R.J., Schrag R.C., Using CSP Look-Back Techniques to Solve Real-World SAT Instances, to appear in proceedings of AAAI-97, Providence, Rhode Island, July 1997.
3. Billionnet A., Sutter A., An efficient algorithm for 3-satisfiability problem, Operations Research Letters, 12:29-36, July 1992.
4. Cook S.A., The Complexity of Theorem Proving Procedures, Proceedings of 3rd ACM Symp. on Theory of Computing, Ohio, 1971, pp. 151-158.
5. Crawford J.M., Auton L.D., Experimental results on the Crossover point in Random 3-SAT, Artificial Intelligence, No. 81, 1996.
6. Davis M., Logemann G., Loveland D., A machine program for theorem proving, Commun. ACM 5, 1962, pp. 394-397.
7. Dubois O., Andre P., Boufkhad Y., Carlier J., SAT versus UNSAT. Second DI-MACS Implementation Challenge, D. S. Johnson and M. A. Trick (eds.), 1993.
8. Freeman J.W., Improvements to propositional satisfiability search algorithms, Ph.D. Thesis, Department of computer and Information science, University of Pennsylvania, Philadelphia, PA, 1995.
9. Gloess P.Y., U-Log, a Unified Object Logic, Revue d'intelligence artificielle, Vol. 5, No. 3, 1991, pp. 33-66.
10. Hooker J.N., Vinay V., Branching rules for satisfiability, Journal of Automated Reasoning, 15:359-383, 1995.
11. Jeroslow R., Wang J., Solving propositional satisfiability problems, Annals of Mathematics and Al 1, 1990, pp. 167-187.
12. Kim S., Zhang H., ModGen: Theorem proving by model generation, Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94), 1994, pp. 162-167.
13. Li C.M., Exploiting yet more the power of unit clause propagation to solve 3-SAT problem, Proceedings of the ECAI'96 Workshop on Advances in Propositional Deduction, Budapest, Hungary, August 1996, pp. 11-16.
14. Li C.M., Anbulagan, Heuristics Based on Unit Propagation for Satisfiability Problems, to appear in Proceedings of IJCAI'97, Nagoya, Japan, August 1997.
15. Mitchell D., Selman B., Levesque H., Hard and Easy Distributions of SAT Problems, Proceedings of the 10th National Conference on Artificial Intelligence (AAAI-92), San Jose, CA, July 1992, pp. 459-465.
16. Pretolani D., Satisfiability and hypergraphs, Ph.D. Thesis, Dipartimento di Informatica, Università di Pisa, 1993.
17. Silva J. P. M., Sakallah K. A., Conflict Analysis in Search Algorithms for Propositional Satisfiability, Proceedings of the International Conference on Tools with Artificial Intelligence, November 1996.
18. Stephan P. R., Brayton R. K., Sangiovanni-Vincentelli A. L., Combinational Test Generation Using Satisfiability, Memorandum No. UCB/ERL M92/112, EECS Department, University of California at Berkeley, October 1992.