Bi-decomposing large Boolean functions via interpolation and satisfiability solving
Proceedings of the 45th annual Design Automation Conference
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
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper)
ISMVL '10 Proceedings of the 2010 40th IEEE International Symposium on Multiple-Valued Logic
Boosting minimal unsatisfiable core extraction
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
On improving MUS extraction algorithms
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
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
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
Preserving partial solutions while relaxing constraint networks
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Minimally Unsatisfiable Subformulas (MUSes) find a wide range of practical applications. A large number of MUS extraction algorithms have been proposed over the last decade, and most of these algorithms are based on iterative calls to a SAT solver. In this paper we introduce a powerful technique for acceleration of MUS extraction algorithms called recursive model rotation --- a recursive version of the recently proposed model rotation technique. We demonstrate empirically that recursive model rotation leads to multiple orders of magnitude performance improvements on practical instances, and pushes the performance of our MUS extractor MUSer2 ahead of the currently available MUS extraction tools.