Exact Max-SAT solvers for over-constrained problems.
Josep ArgelichFelip ManyàPublished in: J. Heuristics (2006)
Keyphrases
- max sat
- sat solvers
- maximum satisfiability
- sat solving
- weighted max sat
- sat problem
- orders of magnitude
- constraint satisfaction
- propositional satisfiability
- graph coloring
- satisfiability problem
- boolean satisfiability
- tabu search
- sat instances
- branch and bound algorithm
- lower bound
- search algorithm
- branch and bound
- unit propagation
- search tree
- stochastic local search
- search strategies
- search space
- max sat solver
- cnf formula
- linear programming
- clause learning
- variable ordering
- sat encodings
- unsatisfiable cores
- randomly generated
- multi objective
- neural network