A scalable algorithm for minimal unsatisfiable core extraction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4121 LNCS, Issue , 2006, Pages 36-41

  Dershowitz, Nachum ^a   Hanna, Ziyad ^b   Nadel, Alexander ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b INTEL CORPORATION   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER APPLICATIONS; COMPUTER SCIENCE;

CORE EXTRACTION; RESOLUTION-REFUTATION PROPERTIES; SUBOPTIMAL ALGORITHMS;

ALGORITHMS;

EID: 33749578689     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814948_5     Document Type: Conference Paper

References (9)

1. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proc. Fifth Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), pages 193-207, 1999.
2. R. Bruni. Approximating minimal unsatisfiable subformulae by means of adaptive core search. Discrete Applied Mathematics, 130(2):85-100, 2003.
3. Z. Fu, Y. Mahajan, and S. Malik. ZChaff2004: An efficient SAT solver. In Proc. Seventh Intl. Conf. on Theory and Applications of Satisfiability Testing (SAT'04), pages 360-375, 2004.
4. E. Goldberg and Y. Novikov. Verification of proofs of unsatisfiability for CNF formulas. In Proc. Design, Automation and Test in Europe Conference and Exhibition (DATE'03), pages 10886-10891, 2003.
5. J. Huang. MUP: A minimal unsatisfiability prover. In Proc. Tenth Asia and South Pacific Design Automation Conference (ASP-DAC'05), pages 432-437, 2005.
6. J. P. Marques-Silva and K. A. Sakallah. GRASP: A search algorithm for prepositional satisfiability. IEEE Transactions on Computers, 48(5):506-521, 1999.
7. st Design Automation Conference (DAC'04), pages 518-523, 2004.
8. M. N. Velev and R. E. Bryant. Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. In Proc. 38th Design Automation Conference (DAC'01), pages 226-231, 2001.
9. L. Zhang and S. Malik. Extracting small unsatisfiable cores from unsatisfiable Boolean formula. In Prelim. Proc. Sixth Intl. Conf. on Theory and Applications of Satisfiability Testing (SAT'03), 2003.