Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
An Application of Matroid Theory to the SAT Problem
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Journal of Automated Reasoning
Relaxations for Compiled Over-Constrained Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Does This Set of Clauses Overlap with at Least One MUS?
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Counterexample guided abstraction refinement algorithm for propositional circumscription
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
On deciding MUS membership with QBF
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Preserving partial solutions while relaxing constraint networks
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
This article presents cmMUS--a tool for deciding whether a clause belongs to some minimal unsatisfiable subset (MUS) of a given formula. While MUS-membership has a number of practical applications, related with understanding the causes of unsatisfiability, it is computationally challenging--it is Σ2P-complete. The presented tool cmMUS solves the problem by translating it to propositional circumscription, a well-known problem from the area of nonmonotonic reasoning. The tool constantly outperforms other approaches to the problem, which is demonstrated on a variety of benchmarks.