Exploiting a Theory of Phase Transitions in Three-Satisfiability Problems.
David M. PennockQuentin F. StoutPublished in: AAAI/IAAI, Vol. 1 (1996)
Keyphrases
- phase transition
- satisfiability problem
- np complete
- constraint satisfaction
- temporal logic
- sat problem
- randomly generated
- combinatorial problems
- np complete problems
- hard problems
- stochastic local search
- sat instances
- random constraint satisfaction problems
- random instances
- random sat
- graph coloring
- cellular automata
- davis putnam
- search algorithm
- max sat
- boolean satisfiability
- industrial applications
- model checking