Solving WCSP by Extraction of Minimal Unsatisfiable Cores.

Christophe Lecoutre Nicolas Paris Olivier Roussel Sébastien Tabary

Published in: ICTAI (2013)

Keyphrases

unsatisfiable cores
max sat
graph coloring
stochastic local search
variable ordering
lower bound
branch and bound algorithm

branch and bound
tabu search
sat solvers
search algorithm
sat problem
boolean satisfiability
hidden structure

maximum satisfiability
boolean formula
satisfiability problem
sat instances
combinatorial optimization
constraint satisfaction

search space
randomly generated
linear programming
upper bound
nonlinear programming
genetic algorithm