An algorithm for the satisfiability problem of formulas in conjunctive normal form.
Rainer SchulerPublished in: J. Algorithms (2005)
Keyphrases
- satisfiability problem
- conjunctive normal form
- objective function
- optimal solution
- stochastic local search algorithms
- np hard
- dynamic programming
- linear programming
- np complete
- cnf formula
- polynomial size
- computational complexity
- simulated annealing
- stochastic local search
- search algorithm
- optimization problems
- search strategy
- search space
- propositional satisfiability