MUP: a minimal unsatisfiability prover
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Local-search Extraction of MUSes
Constraints
Finding Minimal Unsatisfiable Cores of Declarative Specifications
FM '08 Proceedings of the 15th international symposium on Formal Methods
An approach for extracting a small unsatisfiable core
Formal Methods in System Design
Contradictory antecedent debugging in bounded model checking
Proceedings of the 19th ACM Great Lakes symposium on VLSI
Linear-Time Reductions of Resolution Proofs
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Within-problem learning for efficient lower bound computation in Max-SAT solving
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
A simple and flexible way of computing small unsatisfiable cores in SAT modulo theories
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
MUST: provide a finer-grained explanation of unsatisfiability
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Finding unsatisfiable subformulas with stochastic method
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
Searching for autarkies to trim unsatisfiable clause sets
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A heuristic local search algorithm for unsatisfiable cores extraction
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Synthesizing complementary circuits automatically
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Computing small unsatisfiable cores in satisfiability modulo theories
Journal of Artificial Intelligence Research
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Extracting minimum unsatisfiable cores with a greedy genetic algorithm
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Improved single pass algorithms for resolution proof reduction
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Quantified maximum satisfiability: a core-guided approach
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
We tackle the problem of finding a smallest-cardinality MUS (SMUS) of a given formula. The SMUS provides a succinct explanation of infeasibility and is valuable for applications that rely on such explanations. We present a branch-and-bound algorithm that utilizes iterative MAXSAT solutions to generate lower and upper bounds on the size of the SMUS, and branch on specific subformulas to find it. We report experimental results on formulas from DIMACS and DaimlerChrysler product configuration suites.