Solving WCSP by Extraction of Minimal Unsatisfiable Cores
Christophe LecoutreNicolas ParisOlivier RousselSébastien TabaryPublished in: CoRR (2013)
Keyphrases
- unsatisfiable cores
- max sat
- graph coloring
- stochastic local search
- variable ordering
- branch and bound algorithm
- lower bound
- search algorithm
- tabu search
- branch and bound
- satisfiability problem
- hidden structure
- sat solvers
- boolean satisfiability
- boolean formula
- sat problem
- maximum satisfiability
- linear programming
- combinatorial optimization
- constraint satisfaction
- sat instances
- optimal solution
- simulated annealing
- propositional satisfiability
- logic programs
- nonlinear programming
- optimal policy
- phase transition