Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Approximating minimal unsatisfiable subformulae by means of adaptive core search
Discrete Applied Mathematics - The renesse issue on satisfiability
AMUSE: a minimally-unsatisfiable subformula extractor
Proceedings of the 41st annual Design Automation Conference
MUP: a minimal unsatisfiability prover
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Extracting MUCs from Constraint Networks
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Journal of Artificial Intelligence Research
Extracting constraint satisfaction subproblems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Identifying conflicts in overconstrained temporal problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Russian doll search for solving constraint optimization problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
On finding all minimally unsatisfiable subformulas
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Restoring CSP Satisfiability with MaxSAT
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
On computing minimal equivalent subformulas
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Hi-index | 0.00 |
If a CSP instance has no solution, it contains a smaller unsolvable subproblem that makes unsolvable the whole problem. When solving such instance, instead of just returning the "no solution" message, it is of interest to return an unsolvable subproblem. The detection of such unsolvable subproblems has many applications: failure explanation, error diagnosis, planning, intelligent backtracking, etc. In this paper, we give a method for extracting a Minimal Unsolvable Subproblem (MUS) from a CSP based on a Forward Checking algorithm with Dynamic Variable Ordering (FC-DVO). We propose an approach that improves existing techniques using a two steps algorithm. In the first step, we detect an unsolvable subproblem selecting a set of constraints, while in the second step we refine this unsolvable subproblem until a MUS is obtained. We provide experimental results that show how our approach improves other approaches based on MAC-DVO algorithms.