Look-ahead versus look-back for satisfiability problems
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 341-355
- https://doi.org/10.1007/bfb0017450
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Experimental results on the crossover point in random 3-SATArtificial Intelligence, 1996
- Using CSP look-back techniques to solve exceptionally hard SAT instancesPublished by Springer Nature ,1996
- Branching rules for satisfiabilityJournal of Automated Reasoning, 1995
- An efficient algorithm for the 3-satisfiability problemOperations Research Letters, 1992
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- A machine program for theorem-provingCommunications of the ACM, 1962