Sequential Encodings from Max-CSP into Partial Max-SAT.
Josep ArgelichAlba CabiscolInês LynceFelip ManyàPublished in: SAT (2009)
Keyphrases
- max sat
- max csp
- boolean satisfiability
- constraint satisfaction
- sat solvers
- weighted max sat
- sat problem
- lower bound
- maximum satisfiability
- arc consistency
- sat instances
- graph coloring
- search algorithm
- tabu search
- satisfiability problem
- branch and bound algorithm
- sat encodings
- constraint satisfaction problems
- orders of magnitude
- unsatisfiable cores
- branch and bound
- linear programming
- cnf formula
- constraint networks
- combinatorial problems
- max sat solver
- np hard
- soft constraints
- phase transition
- np complete
- special case
- neural network
- random sat instances
- planning problems