New Bounds for MAX-SAT by Clause Learning.
Alexander S. KulikovKonstantin KutzkovPublished in: CSR (2007)
Keyphrases
- max sat
- sat solvers
- clause learning
- sat problem
- lower bound
- weighted max sat
- propositional satisfiability
- sat solving
- satisfiability problem
- constraint satisfaction
- boolean satisfiability
- upper bound
- orders of magnitude
- search tree
- search space
- search strategies
- max sat solver
- unit propagation
- stochastic local search
- sat instances
- maximum satisfiability
- search algorithm
- branch and bound
- cnf formula
- constraint satisfaction problems
- phase transition
- davis putnam
- boolean formula
- branch and bound algorithm
- temporal logic
- constraint programming
- np complete
- scheduling problem
- randomly generated
- answer sets