The complexity of facets resolved
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
A machine program for theorem-proving
Communications of the ACM
On subclasses of minimal unsatisfiable formulas
Discrete Applied Mathematics - Special issue on Boolean functions and related problems
Boosting complete techniques thanks to local search methods
Annals of Mathematics and Artificial Intelligence
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
Using Failed Local Search for SAT as an Oracle for Tackling Harder A.I. Problems More Efficiently
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
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
MUP: a minimal unsatisfiability prover
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
On finding all minimally unsatisfiable subformulas
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Eliminating Redundant Clauses in SAT Instances
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Finding Minimal Unsatisfiable Cores of Declarative Specifications
FM '08 Proceedings of the 15th international symposium on Formal Methods
A Default Logic Patch for Default Logic
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
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
MUST: provide a finer-grained explanation of unsatisfiability
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Efficient combination of decision procedures for MUS computation
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Extending Removed Sets Revision to partially preordered belief bases
International Journal of Approximate Reasoning
Boosting local search thanks to CDCL
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
On improving MUS extraction algorithms
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Towards efficient MUS extraction
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Restoring CSP Satisfiability with MaxSAT
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Factoring out assumptions to speed up MUS extraction
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Improving glucose for incremental SAT solving with assumptions: application to MUS extraction
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
Minimally unsatisfiable subformulas (in short, MUSes) represent the smallest explanations for the inconsistency of SAT instances in terms of the number of involved clauses. Extracting MUSes can thus prove valuable because it circumscribes the sources of contradiction in an instance. In this paper, a new heuristic-based approach to approximate or compute MUSes is presented. It is shown that it often outperforms current competing ones.