Keyphrases
- satisfiability problem
- solving hard
- stochastic local search
- sat instances
- np complete
- search algorithm
- phase transition
- finite domain
- temporal logic
- weighted max sat
- sat problem
- davis putnam logemann loveland
- systematic search algorithms
- pspace complete
- stochastic local search algorithms
- decision procedures
- graph coloring problems
- np hard
- computational properties
- combinatorial optimization
- constraint satisfaction
- random sat
- constraint satisfaction problems