On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Tractable reasoning via approximation
Artificial Intelligence
Investigations on autark assignments
Discrete Applied Mathematics - Special issue on Boolean functions and related problems
A logical toolbox for knowledge approximation
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
MUP: a minimal unsatisfiability prover
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
The universe of propositional approximations
Theoretical Computer Science - Logic, language, information and computation
Local-search Extraction of MUSes
Constraints
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Journal of Automated Reasoning
On Approaches to Explaining Infeasibility of Sets of Boolean Clauses
ICTAI '08 Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence - Volume 01
Boosting a complete technique to find MSS and MUS thanks to a local search oracle
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Searching for autarkies to trim unsatisfiable clause sets
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
cmMUS: a tool for circumscription-based MUS membership testing
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
On deciding MUS membership with QBF
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Enforcing logically weaker knowledge in classical logic
KSEM'11 Proceedings of the 5th international conference on Knowledge Science, Engineering and Management
Hi-index | 0.00 |
This paper is concerned with the problem of checking whether a given subset Γ of an unsatisfiable Boolean CNF formula Σ takes part in the basic causes of the inconsistency of Σ. More precisely, an original approach is introduced to check whether Γ overlaps with at least one minimally unsatisfiable subset (MUS) of Σ. In the positive case, it intends to compute and deliver one such MUS. The approach re-expresses the problem within an evolving coarser-grained framework where clusters of clauses of Σ are formed and examined according to their levels of mutual conflicts when they are interpreted as basic interacting entities. It then progressively refines the framework and the solution by splitting most promising clusters and pruning the useless ones until either some maximal preset computational resources are exhausted, or a final solution is discovered. The viability and the usefulness of the approach are illustrated through benchmarks experimentations.