Advertisement

A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas

  • Maher Mneimneh
  • Inês Lynce
  • Zaher Andraus
  • João Marques-Silva
  • Karem Sakallah
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3569)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bruni, R., Sassano, A.: Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae. Electronic Notes in Discrete Mathematics 9 (2001)Google Scholar
  2. 2.
    Huang, J.: MUP: A Minimal Unsatisfiability Prover. In: Proceedings of Asia South Pacific Design Automation Conference (2005)Google Scholar
  3. 3.
    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
  4. 4.
    Lynce, I., Marques-Silva, J.: On Computing Minimum Unsatisfiable Cores. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 305–310. Springer, Heidelberg (2005)Google Scholar
  5. 5.
    SAT benchmarks from Automotive Product Configuration, http://www-sr.informatik.unituebingen.de/~sinz/DC/
  6. 6.
  7. 7.
    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

  • Maher Mneimneh
    • 1
  • Inês Lynce
    • 2
  • Zaher Andraus
    • 1
  • João Marques-Silva
    • 2
  • Karem Sakallah
    • 1
  1. 1.University of Michigan 
  2. 2.Technical University of LisbonPortugal

Personalised recommendations