Recognizing Disguised NR(1) Instances of the Satisfiability Problem.
Bengt AspvallPublished in: J. Algorithms (1980)
Keyphrases
- satisfiability problem
- stochastic local search
- solving hard
- sat instances
- np complete
- search algorithm
- phase transition
- temporal logic
- sat problem
- randomly generated
- pspace complete
- random instances
- stochastic local search algorithms
- propositional satisfiability
- random sat
- max sat
- decision procedures
- np hard
- finite domain
- weighted max sat
- systematic search algorithms
- computational complexity