Delayed theory combination vs. Nelson-Oppen for satisfiability Modulo theories: A comparative analysis

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

Volumn 4246 LNAI, Issue , 2006, Pages 527-541

  Bruttomesso, Roberto ^a   Cimatti, Alessandro ^a   Franzén, Anders ^a,b   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; COMPUTER SCIENCE; INTERFACES (COMPUTER);

BOOLEAN SEARCH SPACE; DELAYED THEORY; INTERFACE EQUALITIES; SATISFIABILITY MODULO THEORY;

COMPUTATION THEORY;

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

References (15)

1. A. Armando, C. Castellini, E. Giunchiglia, and M. Maratea. A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints. In Proc. SAT'04, 2004.
2. C.L. Barrett and S. Berezin. CVC Lite: A New Implementation of the Cooperating Validity Checker. In Proc. CAV'04, volume 3114 of LNCS. Springer, 2004.
3. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P.van Rossum, S. Ranise, and R. Sebastiani. Efficient Satisfiability Modulo Theories via Delayed Theory Combination. In Proc. Int. Conf. on Computer-Aided Verification, CAV 2005., volume 3576 of LNCS. Springer, 2005.
4. 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, volume 3440 of LNCS. Springer, 2005.
5. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P.van Rossum, S. Schulz, and R. Sebastiani. MathSAT: A Tight Integration of SAT and Mathematical Decision Procedure. Journal of Automated Reasoning, 2005. to appear.
6. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P. van Rossum, S. Ranise, and R. Sebastiani. Efficient Theory Combination via Boolean Search. Information and Computation, 2005. To appear.
7. R. Bruttomesso, A. Cimatti, A. Franzén, A. Griggio, and R. Sebastiani. Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: a Comparative Analysis. Technical Report DIT-06-032, DIT, University of Trento, 2006. Available at http://dit.unitn.it/~rseba/papers/ lpar06_dtc_extended.pdf.
8. S. Cotton, E. Asarin, O. Maler, and P. Niebert. Some Progress in Satisfiability Checking for Difference Logic. In Proc. FORMATS-FTRTFT 2004, 2004.
9. J.-C. Filliâtre, S. Owre, H. Rueß, and N. Shankar. ICS: Integrated Canonizer and Solver. In Proc. CAV'01, volume 2102 of LNCS, pages 246-249, 2001.
10. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast decision procedures. In Proc. CAV'04, volume 3114 of LNCS, pages 175-188. Springer, 2004.
11. G. Nelson and D.C. Oppen. Simplification by Cooperating Decision Procedures. ACM Trans. on Programming Languages and Systems, 1(2):245-257, 1979.
12. R. Nieuwenhuis and A. Oliveras. Congruence Closure with Integer Offsets. In Proc. 10th LPAR, number 2850 in LNAI, pages 77-89. Springer, 2003.
13. R.E. Shostak. Deciding Combinations of Theories. Journal of the ACM, 31:1-12, 1984.
14. L. Zhang, C. F. Madigan, M. H. Moskewicz, and S. Malik. Efficient conflict driven learning in a boolean satisfiability solver. In Proc. ICCAD '01. IEEE Press, 2001.
15. L. Zhang and S. Malik. The quest for efficient boolean satisfiability solvers. In Proc. CAV'02, number 2404 in LNCS, pages 17-36. Springer, 2002.