Advertisement

On Finding All Minimally Unsatisfiable Subformulas

  • Mark H. Liffiton
  • Karem A. Sakallah
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3569)

Abstract

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.

Keywords

Satisfying Assignment Incremental Search Unsatisfiable Core Minimal Unsatisfiable Subset Maximal Satisfiability 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bailey, J., Stuckey, P.J.: Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization. In: Hermenegildo, M.V., Cabeza, D. (eds.) PADL 2004. LNCS, vol. 3350, pp. 174–186. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 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. 3.
    Bruni, R., Sassano, A.: Restoring Satisfiability or Maintaining Unsatisfiability by Finding Small Unsatisfiable Subformulae. Electronic Notes in Discrete Mathematics 9 (2001)Google Scholar
  4. 4.
    Bruni, R.: Approximating Minimal Unsatisfiable Subformulae by Means of Adaptive Core Search. Discrete Applied Mathematics 130(2), 85–100 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Chinneck, J.W., Dravnieks, E.W.: Locating Minimal Infeasible Constraint Sets in Linear Programs. ORSA Journal on Computing 3(2), 157–168 (1991)zbMATHGoogle Scholar
  6. 6.
    Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 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. 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. 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
  10. 10.
    Oh, Y., Mneimneh, M., Andraus, Z., Sakallah, K., Markov, I.L.: AMUSE: A Minimally-Unsatisfiable Subformula Extractor. In: Proc. of the 41st Annual Conference on Design Automation, pp. 518–523. ACM Press, New York (2004)CrossRefGoogle Scholar
  11. 11.
    SAT benchmarks from Automotive Product Configuration, http://www-sr.informatik.uni-tuebingen.de/~sinz/DC/
  12. 12.
    Sinz, C., Kaiser, A., Küchlin, W.: Formal Methods for the Validation of Automotive roduct Configuration Data. Artificial Intelligence for Engineering Design, Analysis and Manufacturing 17(1), 75–97 (2003)CrossRefGoogle Scholar
  13. 13.
    Zhang, L., Malik, S.: Extracting small unsatisfiable cores from unsatisfiable Boolean formula. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919. Springer, Heidelberg (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Mark H. Liffiton
    • 1
  • Karem A. Sakallah
    • 1
  1. 1.Department of Electrical Engineering and Computer ScienceUniversity of MichiganAnn Arbor

Personalised recommendations