Solving Max-SAT as Weighted CSP.
Simon de GivryJavier LarrosaPedro MeseguerThomas SchiexPublished in: CP (2003)
Keyphrases
- max sat
- weighted max sat
- sat problem
- sat solvers
- finding optimal solutions
- constraint satisfaction problems
- constraint satisfaction
- stochastic local search
- graph coloring
- variable ordering
- sat encodings
- lower bound
- max sat solver
- unit propagation
- satisfiability problem
- branch and bound algorithm
- sat instances
- tabu search
- search algorithm
- branch and bound
- maximum satisfiability
- random sat instances
- constraint propagation
- boolean satisfiability
- phase transition
- propositional satisfiability
- linear programming
- search space
- computational complexity
- boolean formula
- search tree
- orders of magnitude
- np complete