On finding all minimally unsatisfiable subformulas

Lecture Notes in Computer Science

Volumn 3569, Issue , 2005, Pages 173-186

  Liffiton, Mark H ^a   Sakallah, Karem A ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY;

BOOLEAN FORMULAS; MINIMALLY UNSATISFIABLE SUBFORMULAS (MUS);

PROBLEM SOLVING;

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

References (13)

1. J. Bailey and P. J. Stuckey. "Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization." In Proc. of the 7th International Symposium on Practical Aspects of Declarative Languages (PADL05), volume 3350 of Lecture Notes in Computer Science. Springer-Verlag, 2005.
2. M. de la Banda, P. Stuckey, and J. Wazny. "Finding All Minimal Unsatisfiable Subsets." In Proc. of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP 2003), pages 32-43, 2003.
3. R. Bruni and A. Sassano. "Restoring Satisfiability or Maintaining Unsatisfiability by Finding Small Unsatisfiable Subformulae." Electronic Notes in Discrete Mathematics, vol. 9, 2001.
4. R. Bruni. "Approximating Minimal Unsatisfiable Subformulae by Means of Adaptive Core Search." Discrete Applied Mathematics, vol. 130(2), pages 85-100, 2003.
5. J.W. Chinneck and E.W. Dravnieks, "Locating Minimal Infeasible Constraint Sets in Linear Programs." ORSA Journal on Computing, Vol. 3, No. 2, pp. 157-168, 1991.
6. N. Eén and N. Sörensson. "An Extensible SAT-solver." In Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT03), 2003.
7. J. Huang. "MUP: A Minimal Unsatisfiability Prover." In Proc. of the Tenth Asia and South Pacific Design Automation Conference (ASP-DAC), January 2005.
8. R. M. Karp. "Reducibility Among Combinatorial Problems." In Proc. of a Symposium on the Complexity of Computer Computations, pages 85-103, 1972.
9. 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.
10. Y. Oh, M. Mneimneh, Z. Andraus, K. Sakallah, and I. L. Markov. "AMUSE: A Minimally-Unsatisfiable Subformula Extractor." In Proc. of the 41st Annual Conference on Design Automation, pages 518-523, ACM Press, 2004.
11. SAT benchmarks from Automotive Product Configuration, http://www-sr.informatik.unituebingen.de/~sinz/DC/
12. C. Sinz, A. Kaiser, and W. Küchlin. "Formal Methods for the Validation of Automotive roduct Configuration Data." In Artificial Intelligence for Engineering Design, Analysis and Manufacturing, vol. 17 no. 1, pages 75-97, 2003.
13. L. Zhang and S. Malik. "Extracting small unsatisfiable cores from unsatisfiable Boolean formula." Presented at the Sixth International Conference on Theory and Applications of Satisfiability Testing, 2003.