Solving WCSP by Extraction of Minimal Unsatisfiable Cores
classification
💻 cs.AI
keywords
algorithmapproachcoresextractionminimalsolveunsatisfiablewcsp
read the original abstract
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 decline our approach in two ways: an incomplete, greedy, algorithm and a complete one.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.