On Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the problem, strongly linking it to the maximal satisfiability problem. From this relationship, we have developed a novel technique for extracting all MUSes of a CNF formula, tightly integrat ing our implementation with a modern SAT solver. We also present another algorithm for finding all MUSes, developed independently but based on the same relationship. Experimental comparisons show that our approach is con sistently faster than the other, and we discuss ways in which ideas from both could be combined to improve further.
KeywordsSatisfying Assignment Incremental Search Unsatisfiable Core Minimal Unsatisfiable Subset Maximal Satisfiability
Unable to display preview. Download preview PDF.
- 2.de la Banda, M., Stuckey, P., Wazny, J.: Finding All Minimal Unsatisfiable Subsets. In: Proc. of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP 2003), pp. 32–43 (2003)Google Scholar
- 3.Bruni, R., Sassano, A.: Restoring Satisfiability or Maintaining Unsatisfiability by Finding Small Unsatisfiable Subformulae. Electronic Notes in Discrete Mathematics 9 (2001)Google Scholar
- 7.Huang, J.: MUP: A Minimal Unsatisfiability Prover. In: Proc. of the Tenth Asia and South Pacific Design Automation Conference (ASP-DAC) (January 2005)Google Scholar
- 8.Karp, R.M.: Reducibility Among Combinatorial Problems. In: Proc. of a Symposium on the Complexity of Computer Computations, pp. 85–103 (1972)Google Scholar
- 9.Liffiton, M., Andraus, Z., Sakallah, K.: From Max-SAT to Min-UNSAT: Insights and Applications. Technical Report CSE-TR-506-05, University of Michigan (2005)Google Scholar
- 11.SAT benchmarks from Automotive Product Configuration, http://www-sr.informatik.uni-tuebingen.de/~sinz/DC/