Maintaining and Handling All Unit Propagation Reasons in Exact Max-SAT Solvers.
André AbraméDjamal HabetPublished in: SOCS (2014)
Keyphrases
- unit propagation
- max sat
- sat solvers
- lower bound
- branch and bound algorithm
- branch and bound
- tabu search
- maximum satisfiability
- sat problem
- search algorithm
- search tree
- graph coloring
- stochastic local search
- satisfiability problem
- constraint satisfaction
- variable ordering
- sat encodings
- linear programming
- boolean satisfiability
- conjunctive normal form
- orders of magnitude
- upper bound
- search space
- cnf formula
- np hard
- dynamic programming
- propositional satisfiability
- clause learning
- computational complexity