AMUSE: A minimally-unsatisfiable subformula extractor

Proceedings - Design Automation Conference

Volumn , Issue , 2004, Pages 518-523

  Oh, Yoonna ^a   Mneimneh, Maher N ^a   Andraus, Zaher S ^a   Sakallah, Karem A ^a   Markov, Igor L ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

(MUS); Boolean satisfiability (SAT); Conjunctive normal form (CNF); Diagnosis; Minimally unsatisfiable subformula

Indexed keywords

BOOLEAN SATISFIABILITY (SAT); CONJUNCTIVE NORMAL FORM (CNF); MINIMALLY-UNSATISFIABLE SUBFORMULA (MUS);

ALGORITHMS; AUTOMATION; BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; FIELD PROGRAMMABLE GATE ARRAYS; POLYNOMIALS;

COMPUTATIONAL METHODS;

EID: 4444353562     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. R. Aharoni and N. Linial, "Minimal Non-Two-Colorable Hypergraphs and Minimal Unsatisfiable Formulas," in J. Combinatorial Theory, Series A, vol. 43, 1986.
2. R. Bruni and A. Sassano, "Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae," in Electronic Notes in Discrete Mathematics, vol. 9, 2001.
3. G. Davydov, I. Davydova, and H. K. Buning, "An Efficient Algorithm for the Minimal Unsatisfiability Problem for a Subclass of CNF," in Annals of Mathematics and Artificial Intelligence, vol. 23, pp. 229-245, 1998.
4. H. Fleischner, O. Kullmann, and S. Szeider. "Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference," in Theoretical Computer Science, 289(1), pp.503-516, 2002.
5. H. Kleine Buning, "On Subclasses of Minimal Unsatisfiable Formulas," in Discrete Applied Mathematics, 197(1-3), pp. 83-98, 2000.
6. N. Eén, and N. Sörensson, "An Extensible SAT-solver," in Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT), 2003.
7. J. P. Marques-Silva and K. A. Sakallah, "GRASP: A Search Algorithm for Propositional Satisfiability," in IEEE Transactions on Computers, vol. 48, 1999.
8. K. L. McMillan, Symbolic Model Checking: An Approach to the State Explosion Problem, Kluwer Academic Publishers, 1993.
9. G. Nam, F. A. Aloul, K. A. Sakallah, and R. A. Rutenbar, "A Comparative Study of Two Boolean Formulations of FPGA Detailed Routing Constraints," in Proceedings of the ISPD 2001.
10. C. H. Papadimitriou, and D. Wolfe, "The Complexity of Facets Resolved," in J. Computer and System Sciences, vol. 37, pp. 2-13, 1988.
11. SAT benchmarks from Automotive Product Configuration, http://www-sr.informatik.uni-tuebingen.de/~sinz/DC/
12. C. Sinz, A. Kaiser, and W. Küchlin, "Formal Methods for the Validation of Automotive Product Configuration Data," in Artificial Intelligence for Engineering Design, Analysis and Manufacturing, 17(1), pp. 75-97, January 2003.
13. J. Whittemore, J. Kim, and K. A. Sakallah, "SATIRE: A New Incremental Satisfiability Engine," in Proc. 38th IEEE/ACM Design Automation Conference (DAC), pp. 542-545, June 2001, Las Vegas, Nevada
14. L. Zhang, C. Madigan, M. Moskewicz, and S. Malik, "Efficient Conflict Driven Learning in a Boolean Satisfiability Solver," in Proceedings of the International Conference on Computer-Aided Design, pp. 279-285, 2001.
15. L. Zhang and S. Malik, "Extracting Small Unsatisfiable Cores from Unsatisfiable Boolean Formula," presented at Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), S. Margherita Ligure - Portofino, Italy, 2003.