Cause clue clauses: error localization using maximum satisfiability
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Minimally unsatisfiable boolean circuits
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
On improving MUS extraction algorithms
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Accelerating MUS extraction with recursive model rotation
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Towards efficient MUS extraction
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
On efficient computation of variable MUSes
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
On computing minimal equivalent subformulas
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Understanding, improving and parallelizing MUS finding using model rotation
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Reasoning over biological networks using maximum satisfiability
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Core minimization in SAT-based abstraction
Proceedings of the Conference on Design, Automation and Test in Europe
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Quantified maximum satisfiability: a core-guided approach
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
MUStICCa: MUS extraction with interactive choice of candidates
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Hi-index | 0.00 |
The task of modeling and reasoning about real-world problems often involves analyzing overconstrained representations, where not all constraints of a problem can be simultaneously satisfied. The need to analyze over-constrained (or unsatisfiable) problems occurs in many settings, including data and knowledge bases, artificial intelligence, applied formal methods, operations research and description logics. In most cases, the problem to solve is related with some form of minimal unsatisfiability, i.e. an irreducible set of constraints that explains unsatisfiability. This paper provides an overview of some of the computational problems related with minimal unsatisfiability in Boolean logic, including the identification of one minimal unsatisfiable sub-formula and the identification of all minimal unsatisfiable sub-formulas. In addition, the paper briefly overviews practical applications of minimal unsatisfiability. Finally, the paper highlights recent work on minimal unsatisfiability in other domains.