A simple and flexible way of computing small unsatisfiable cores in SAT modulo theories

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

Volumn 4501 LNCS, Issue , 2007, Pages 334-339

  Cimatti, Alessandro ^a   Griggio, Alberto ^b   Sebastiani, Roberto ^b  

^a ITC IRST   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; MODEL CHECKING; PROBLEM SOLVING;

PROPOSITIONAL CORE EXTRACTORS; SAT MODULO THEORIES (SMT);

COMPUTATION THEORY;

EID: 38049156294     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72788-0_32     Document Type: Conference Paper

References (11)

1. C. Barrett and S. Berezin. CVC Lite: A New Implementation of the Cooperating Validity Checker. In Proc. CAV'04, 2004.
2. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P.van Rossum, S. Schulz, and R. Sebastiani. An incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic. In Proc. TACAS'05, 2005.
3. A. Cimatti, A. Griggio, and R. Sebastiani. A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories. Technical Report DIT-07-006, DIT, Univ. of Trento, 2007. Extended version. Available at http://dit.unitn.it/~griggio/papers/sat07_extended.pdf.
4. N. Dershowitz, Z. Hanna, and A. Nadel. A Scalable Algorithm for Minimal Unsatisfiable Core Extraction. In Proc. SAT'06, 2006.
5. B. Dutertre and L. de Moura. A Fast Linear-Arithmetic Solver for DPLL(T). In Proc. CAV'06, 2006.
6. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast decision procedures. In Proc. CAV'04, 2004.
7. R. Gershman, M. Koifman, and O. Strichman. Deriving Small Unsatisfiable Cores with Dominators. In Proc. CAV'06, 2006.
8. I. Lynce and J. P. Marques Silva. On computing minimum unsatisfiable cores. In Proc. SAT'04, 2004.
9. M. N. Mneimneh, I. Lynce, Z. S. Andraus, J. P. Marques Silva, and K. A. Sakallah. A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas. In Proc. SAT'05, 2005.
10. J. Zhang, S. Li, and S. Shen. Extracting Minimum Unsatisfiable Cores with a Greedy Genetic Algorithm. In Proc. ACAI'06, 2006.
11. L. Zhang and S. Malik. Extracting small unsatisfiable cores from unsatisfiable boolean formula. In Proc. SAT'03, 2003.