The Role of Redundant Clauses in Solving Satisfiability Problems.
Honglei ZengSheila A. McIlraithPublished in: CP (2005)
Keyphrases
- satisfiability problem
- random sat
- solving hard
- stochastic local search
- davis putnam logemann loveland
- phase transition
- conjunctive normal form
- np complete
- sat instances
- sat problem
- finite domain
- search algorithm
- temporal logic
- first order logic
- clause learning
- boolean formula
- boolean satisfiability
- max sat
- davis putnam
- graph coloring problems
- combinatorial optimization
- stochastic local search algorithms
- pspace complete
- mazurkiewicz traces