Resolution in Max-SAT and its relation to local consistency in weighted CSPs.
Javier LarrosaFederico HerasPublished in: IJCAI (2005)
Keyphrases
- max sat
- sat problem
- constraint satisfaction
- constraint satisfaction problems
- sat solvers
- max sat solver
- unit propagation
- clause learning
- graph coloring
- weighted max sat
- constraint networks
- constraint problems
- path consistency
- tabu search
- lower bound
- satisfiability problem
- branch and bound algorithm
- search algorithm
- boolean satisfiability
- np complete
- phase transition
- branch and bound
- stochastic local search
- search space
- propositional satisfiability
- arc consistency
- constraint propagation
- sat instances
- constraint programming
- symmetry breaking
- linear programming
- combinatorial problems
- finding optimal solutions
- variable ordering
- sat encodings
- inference rules
- maximum satisfiability
- unsatisfiable cores
- information retrieval
- neural network
- randomly generated
- cnf formula
- decision problems