The complexity of facets resolved
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Readings in model-based diagnosis
Readings in model-based diagnosis
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
On subclasses of minimal unsatisfiable formulas
Discrete Applied Mathematics - Special issue on Boolean functions and related problems
An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
Annals of Mathematics and Artificial Intelligence
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
Theoretical Computer Science
Finding all minimal unsatisfiable subsets
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive 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
On Exact Selection of Minimally Unsatisfiable Subformulae
Annals of Mathematics and Artificial Intelligence
Tracking MUSes and Strict Inconsistent Covers
FMCAD '06 Proceedings of the Formal Methods in Computer Aided Design
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
On finding all minimally unsatisfiable subformulas
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
On subsumption removal and on-the-fly CNF simplification
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
Local-search Extraction of MUSes
Constraints
Finding Minimal Unsatisfiable Cores of Declarative Specifications
FM '08 Proceedings of the 15th international symposium on Formal Methods
Relaxations for Compiled Over-Constrained Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A Default Logic Patch for Default Logic
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Dealing Automatically with Exceptions by Introducing Specificity in ASP
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Does This Set of Clauses Overlap with at Least One MUS?
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Representative explanations for over-constrained problems
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Integrating systematic and local search paradigms: a new strategy for MaxSAT
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
MUST: provide a finer-grained explanation of unsatisfiability
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Searching for autarkies to trim unsatisfiable clause sets
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Efficient combination of decision procedures for MUS computation
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
On the measure of conflicts: Shapley Inconsistency Values
Artificial Intelligence
On improving MUS extraction algorithms
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Finding first-order minimal unsatisfiable cores with a heuristic depth-first-search algorithm
IDEAL'11 Proceedings of the 12th international conference on Intelligent data engineering and automated learning
Alloy+HotCore: a fast approximation to unsat core
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Towards efficient MUS extraction
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
On computing minimal correction subsets
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
In this paper, a new complete technique to compute Maximal Satisfiable Subsets (MSS) and Minimally Unsatisfiable Subformulas (MUS) of sets of Boolean clauses is introduced. The approach improves the currently most efficient complete technique in several ways. It makes use of the powerful concept of critical clause and of a computationally inexpensive local search oracle to boost an exhaustive algorithm proposed by Liffiton and Sakallah. These features can allow exponential efficiency gains to be obtained. Accordingly, experimental studies show that this new approach outperforms the best current existing exhaustive ones.