Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances.
Roberto J. Bayardo Jr.Robert SchragPublished in: CP (1996)
Keyphrases
- random instances
- sat instances
- sat problem
- constraint satisfaction problems
- phase transition
- sat solvers
- satisfiability problem
- hard problems
- randomly generated
- lower bound
- boolean satisfiability
- constraint satisfaction
- orders of magnitude
- constraint programming
- heuristic search
- propositional satisfiability
- special case
- database
- random sat