To Ackermann-ize or not to Ackermann-ize? on efficiently handling uninterpreted function symbols in SMT(EUF∪ T)

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

Volumn 4246 LNAI, Issue , 2006, Pages 557-571

  Bruttomesso, Roberto ^a   Cimatti, Alessandro ^a   Franzén, Anders ^a,b   Griggio, Alberto ^b   Santuari, Alessandro ^b   Sebastiani, Roberto ^b  

^a ITC IRST   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; FUNCTIONS; PROBLEM SOLVING;

EQUALITY AND UNINTERPRETED FUNCTIONS (EUF); SATISFIABILITY MODULO THEORIES (SMT);

COMPUTATION THEORY;

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

References (16)

1. W. Ackermann. Solvable Cases of the Decision Problem. North Holland Pub. Co., 1954.
2. 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.
3. 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.
4. C. Barrett, L. de Moura, and A. Stump. SMT-COMP: Satisfiability Modulo Theories Competition. In Proc. CAV'05, volume 3576 of LNCS. Springer, 2005.
5. 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.
6. 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, CAV2005., volume 3576 of LNCS. Springer, 2005.
7. 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.
8. 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.
9. 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. In Proc. LPAR'06, 2006.
10. S. Cotton, E. Asarin, O. Maler, and P. Niebert. Some Progress in Satisfiability Checking for Difference Logic. In Proc. FORMATS-FTRTFT 2004, 2004.
11. 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.
12. 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.
13. G. Nelson and D.C. Oppen. Simplification by Cooperating Decision Procedures. ACM Trans. on Programming Languages and Systems, 1(2):245-257, 1979.
14. S. Ranise and C. Tinelli. The SMT-LIB Standard: Version 1.1. Technical Report, 2005.
15. R.E. Shostak. Deciding Combinations of Theories. Journal of the ACM, 31:1-12, 1984.
16. 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.