Regular Encodings from Max-CSP into Partial Max-SAT.
Josep ArgelichAlba CabiscolInês LynceFelip ManyàPublished in: ISMVL (2009)
Keyphrases
- max sat
- max csp
- boolean satisfiability
- constraint satisfaction
- sat solvers
- weighted max sat
- sat problem
- arc consistency
- branch and bound algorithm
- maximum satisfiability
- search algorithm
- graph coloring
- sat instances
- lower bound
- satisfiability problem
- tabu search
- branch and bound
- constraint satisfaction problems
- sat encodings
- phase transition
- orders of magnitude
- probabilistic planning
- heuristic search
- cnf formula
- search tree
- boolean formula
- max sat solver
- constraint networks
- randomly generated
- temporal logic
- linear programming
- constraint propagation
- symmetry breaking
- neural network
- genetic programming
- simulated annealing
- dynamic programming
- data structure