On Solving MaxSAT Through SAT.
Carlos AnsóteguiMaria Luisa BonetJordi LevyPublished in: POS@SAT (2010)
Keyphrases
- sat solvers
- boolean optimization
- boolean satisfiability
- sat problem
- sat solving
- combinatorial optimization
- sat instances
- stochastic local search
- solving hard
- satisfiability problem
- np complete problems
- randomly generated
- sat encodings
- variable ordering
- maximum satisfiability
- search algorithm
- davis putnam logemann loveland
- orders of magnitude
- integer linear programming
- boolean formula
- probabilistic planning
- branch and bound algorithm
- search strategies
- constraint satisfaction
- search space
- phase transition
- constraint satisfaction problems
- np complete
- weighted max sat
- optimization problems
- upper bound