Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination.
Edward A. HirschArist KojevnikovPublished in: CP (2001)
Keyphrases
- boolean satisfiability
- random sat instances
- boolean optimization
- sat solving
- boolean formula
- clause learning
- stochastic local search
- sat solvers
- sat problem
- branch and bound algorithm
- combinatorial optimization
- search space
- symmetry breaking
- randomly generated
- probabilistic planning
- search algorithm
- maximum satisfiability
- sat instances
- max sat
- integer linear programming
- phase transition
- np complete
- genetic algorithm
- satisfiability problem
- propositional satisfiability
- search tree
- orders of magnitude
- tabu search
- simulated annealing
- random sat
- lower bound