Probabilistic performance of a heuristic for the satisfiability problem.
John FrancoYuan Chuan HoPublished in: Discret. Appl. Math. (1988)
Keyphrases
- satisfiability problem
- search algorithm
- stochastic local search
- np complete
- temporal logic
- sat problem
- phase transition
- graph coloring problems
- stochastic local search algorithms
- solving hard
- pspace complete
- max sat
- sat instances
- optimal solution
- cellular automata
- heuristic search
- dynamic programming
- branch and bound
- simulated annealing
- scheduling problem
- decision procedures
- conjunctive normal form
- search strategies
- conjunctive queries
- weighted max sat