Skip to main content
SpringerLink
Log in

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

  • Conference paper
Theory and Applications of Satisfiability Testing (SAT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Huang, J.: MUP: A Minimal Unsatisfiability Prover. In: Proceedings of Asia South Pacific Design Automation Conference (2005)

    Google Scholar 

  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. 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. SAT benchmarks from Automotive Product Configuration, http://www-sr.informatik.unituebingen.de/~sinz/DC/

  6. Satzoo, http://www.cs.chalmers.se/~een/Satzoo/

  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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Michigan,  

    Maher Mneimneh, Zaher Andraus & Karem Sakallah

  2. Technical University of Lisbon, Portugal

    Inês Lynce & João Marques-Silva

Authors
  1. Maher Mneimneh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Inês Lynce
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zaher Andraus
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. João Marques-Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Karem Sakallah
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Toronto, Canada

    Fahiem Bacchus

  2. Dept. of Computer Science, Trinity College, Dublin 2

    Toby Walsh

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mneimneh, M., Lynce, I., Andraus, Z., Marques-Silva, J., Sakallah, K. (2005). A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas. In: Bacchus, F., Walsh, T. (eds) Theory and Applications of Satisfiability Testing. SAT 2005. Lecture Notes in Computer Science, vol 3569. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499107_40

Download citation

  • DOI: https://doi.org/10.1007/11499107_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26276-3

  • Online ISBN: 978-3-540-31679-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation