On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes.
Josep ArgelichRamón BéjarCèsar FernándezCarles MateuJordi PlanesPublished in: Ann. Math. Artif. Intell. (2016)
Keyphrases
- sat solvers
- boolean satisfiability
- sat problem
- maximum satisfiability
- sat instances
- unsatisfiable cores
- sat solving
- max sat
- propositional satisfiability
- orders of magnitude
- constraint satisfaction
- search space
- search strategies
- branch and bound algorithm
- search tree
- symmetry breaking
- phase transition
- satisfiability problem
- clause learning
- lower bound
- boolean formula
- integer linear programming
- randomly generated
- stochastic local search
- probabilistic planning
- backtracking search
- np complete
- combinatorial optimization problems
- sat encodings
- graph coloring
- constraint satisfaction problems
- constraint solver
- upper bound
- temporal logic
- branch and bound
- domain independent