Solving WCSP by Extraction of Minimal Unsatisfiable Cores
Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sébastien Tabary · 2013
Usual techniques to solve WCSP are based on cost transfer operations coupled with a branch and bound algorithm. In this paper, we focus on an approach integrating extraction and relaxation of Minimal Unsatisfiable Cores in order to solve this problem. We derive our approach in two ways: an incomplete, greedy, algorithm and a complete one.