Splitting on demand in SAT Modulo theories

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

Volumn 4246 LNAI, Issue , 2006, Pages 512-526

  Barrett, Clark ^a   Nieuwenhuis, Robert ^b   Oliveras, Albert ^b   Tinelli, Cesare ^c  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c UNIVERSITY OF IOWA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER SCIENCE; SEARCH ENGINES;

SAT ENGINE; SATISFIABILITY MODULO THEORIES (SMT); THEORY SOLVERS;

ALGORITHMS;

EID: 33845215878     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11916277_35     Document Type: Conference Paper

References (14)

1. C. Barrett, L. de Moura, and A. Stump. SMT-COMP. Satisfiability Modulo Theories Competition. In CAV'05, LNCS 3576, pages 20-23. Springer, 2005.
2. C. Barrett, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. Splitting on demand in satisfiability modulo theories. Technical report. University of Iowa, 2006. Available at ftp://ftp.cs.uiowa.edu/pub/tinelli/papers/BarNOT-RR-06.pdf.
3. C. W. Barrett. Checking Validity of Quantifier-Free Formulas in Combinations of First-Order Theories. PhD thesis, Stanford University, 2003.
4. C. W. Barrett and S. Berezin. CVC lite: A new implementation of the cooperating validity checker. In CAV'04, LNCS 3114, pages 515-518. Springer, 2004.
5. C. Barrett, D. Dill, and A. Stump. Checking satisfiability of first-order formulas by incremental translation into SAT. In CAV'02, LNCS 2404, pages 236-249, 2002.
6. M. Bozzano, R. Bruttomesso, A. Cimatti, T. A. Junttila, S. Ranise, P. van Rossum, and R. Sebastiani. Efficient theory combination via boolean search. Information and Computation. To appear. Cf. conference paper at CAV'05.
7. D. Cantone and C. G. Zarba. A new fast tableau-based decision procedure for an unqualified fragment of set theory. In Automated Deduction in Classical and Non-Classical Logics, LNCS 1761, pages 127-137. Springer, 2000.
8. M. Davis, G. Logemann, and D. Loveland. A machine program for theoremproving. Comm. of the ACM, 5(7):394-397, 1962.
9. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960.
10. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast Decision Procedures. In CAV'04, LNCS 3114, pages 175-188. Springer, 2004.
11. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Trans. Program. Lang. Syst., 1(2):245-257, 1979.
12. R. Nieuwenhuis, A. Oliveras, and C. Tinelli. Abstract DPLL and Abstract DPLL Modulo Theories. In LPAR'04, LNAI 3452, pages 36-50. Springer, 2005.
13. A. Stump, C. W. Barrett, D. L. Dill, and J. R. Levitt. A decision procedure for an extensional theory of arrays. In LICS'01, pages 29-37. IEEE Computer Society.
14. C. Tinelli and M. T. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In FroCoS'96, pages 103-120. Kluwer Academic Publishers.