A branch-and-bound algorithm for extracting smallest minimal unsatisfiable formulas

Lecture Notes in Computer Science

Volumn 3569, Issue , 2005, Pages 467-474

  Mneimneh, Maher ^a   Lynce, Inês ^b   Andraus, Zaher ^a   Marques Silva, João ^b   Sakallah, Karem ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

^b UNIVERSITY OF LISBON   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

BRANCH-AND-BOUND ALGORITHM; SMALLEST-CARDINALITY MUS (SMUS);

PROBLEM SOLVING;

EID: 26444609633     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499107_40     Document Type: Conference Paper

References (7)

1. R. Bruni and A. Sassano, "Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae," in Electronic Notes in Discrete Mathematics, vol. 9, 2001.
2. J. Huang, "MUP: A Minimal Unsatisfiability Prover," in Proceedings of Asia South Pacific Design Automation Conference, 2005.
3. M. Liffiton, Z. Andraus, and K. Sakallah, "From MAX-SAT to Min-UNSAT: Insights and Applications," Technical Report CSE-TR-506-05, University of Michigan, 2005.
4. I. Lynce and J. Marques-Silva, "On Computing Minimum Unsatisfiable Cores", in Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT), 2004.
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. L. Zhang and S. Malik, "Extracting Small Unsatisfiable Cores from Unsatisfiable Boolean Formula," in Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), S. Margherita Ligure - Portofino, Italy, 2003.