Hard and Easy Distributions of SAT Problems.
David G. MitchellBart SelmanHector J. LevesquePublished in: AAAI (1992)
Keyphrases
- sat problem
- satisfiability problem
- random sat
- sat solvers
- constraint satisfaction problems
- phase transition
- np complete
- max sat
- randomly generated
- boolean satisfiability
- davis putnam
- truth assignment
- propositional satisfiability
- sat instances
- solving hard
- np complete problems
- maximum satisfiability
- decision problems
- orders of magnitude
- stochastic local search
- knowledge representation
- sat solving
- search algorithm
- branch and bound algorithm
- constraint satisfaction
- cnf formula
- probability distribution
- backtracking search
- knowledge base