Modelling Max-CSP as Partial Max-SAT.
Josep ArgelichAlba CabiscolInês LynceFelip ManyàPublished in: SAT (2008)
Keyphrases
- max sat
- max csp
- constraint satisfaction
- weighted max sat
- lower bound
- sat solvers
- search algorithm
- tabu search
- arc consistency
- branch and bound algorithm
- sat problem
- branch and bound
- maximum satisfiability
- satisfiability problem
- constraint networks
- constraint satisfaction problems
- unsatisfiable cores
- boolean satisfiability
- stochastic local search
- max sat solver
- combinatorial problems
- linear programming
- simulated annealing
- upper bound
- soft constraints
- space complexity
- combinatorial optimization
- random sat instances
- genetic algorithm