Local Consistency in Weighted CSPs and Inference in Max-SAT.
Federico HerasJavier LarrosaPublished in: CP (2005)
Keyphrases
- max sat
- sat problem
- constraint satisfaction
- constraint satisfaction problems
- max sat solver
- weighted max sat
- sat solvers
- graph coloring
- constraint networks
- constraint problems
- lower bound
- path consistency
- tabu search
- branch and bound algorithm
- satisfiability problem
- search algorithm
- branch and bound
- boolean satisfiability
- symmetry breaking
- bayesian networks
- constraint propagation
- arc consistency
- finding optimal solutions
- constraint programming
- maximum satisfiability
- search space
- stochastic local search
- phase transition
- inference rules
- linear programming
- global constraints
- randomly generated
- sat encodings
- np complete
- state space
- upper bound
- special case
- search tree
- variable ordering