Using CSP look-back techniques to solve exceptionally hard SAT instances
- 1 January 1996
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Critical behavior in the computational cost of satisfiability testingArtificial Intelligence, 1996
- The satisfiability constraint gapArtificial Intelligence, 1996
- Generating hard satisfiability problemsArtificial Intelligence, 1996
- Experimental results on the crossover point in random 3-SATArtificial Intelligence, 1996
- Easy problems are sometimes hardArtificial Intelligence, 1994
- The hardest constraint problems: A double phase transitionArtificial Intelligence, 1994
- HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEMComputational Intelligence, 1993
- Enhancement schemes for constraint processing: Backjumping, learning, and cutset decompositionArtificial Intelligence, 1990
- A machine program for theorem-provingCommunications of the ACM, 1962
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960