Strategies for combining decision procedures

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

Volumn 2619, Issue , 2003, Pages 537-552

  Conchon, Sylvain ^a   Krstić, Sava ^b  

^a ECOLE DES MINES DE NANTES   (France)

^b OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; INFERENCE ENGINES;

BASIC SYSTEMS; COMBINATION PROCEDURE; CORRECTNESS PROOFS; DECISION PROCEDURE; INFERENCE SYSTEMS; NELSON-OPPEN PROCEDURE; NON-DETERMINISM; REGULAR EXPRESSIONS;

ALGORITHMS;

EID: 35248846029     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36577-x_39     Document Type: Article

References (17)

1. L. Bachmair, A. Tiwari, and L. Vigneron. Abstract congruence closure. Journal of Automated Reasoning, 2002. To appear.
2. C. Barrett. Checking Validity of Quantifier-free formulas in Combinations of First-Order Theories. PhD thesis, Stanford University, 2002.
3. C. W. Barrett, D. L. Dill, and A. Stump. A generalization of Shostak's method for combining decision procedures. In Frontiers of Combining Systems (FROCOS), volume 2309 of Lecture Notes in Artificial Intelligence, pages 132-147. Springer-Verlag, 2002.
4. S. Conchon and S. Krstic. Strategies for combining decision procedures. Technical Report CSE-03-001, OHSU, 2003.
5. J.-C. Filliâtre, S. Owre, H. Rueß, and N. Shankar. ICS: Integrated Canonization and Solving (Tool presentation). In G. Berry, H. Comon, and A. Finkel, editors, Proceedings of CAV'2001, volume 2102 of Lecture Notes in Computer Science, pages 246-249. Springer-Verlag, 2001.
6. H. Ganzinger. Shostak light. In A. Voronkov, editor, Automated Deduction - CADE-18, volume 2392 of Lecture Notes in Artificial Intelligence, pages 332-347. Springer-Verlag, 2002.
7. D. Kapur. A rewrite rule based framework for combining decision procedures. In Frontiers of Combining Systems (FROCOS), volume 2309 of Lecture Notes in Artificial Intelligence, pages 87-103. Springer-Verlag, 2002.
8. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-257, 1979.
9. G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure. JACM, 27(2):356-364, 1980.
10. Ch. Ringeissen. Cooperation of Decision Procedures for the Satisfiability Problem. In F. Baader and K. U. Schulz, editors, Frontiers of Combining Systems: Proceedings of the 1st International Workshop, Applied Logic, pages 121-140. Kluwer Academic Publishers, 1996.
11. H. Rueß and N. Shankar. Deconstructing Shostak. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science (LICS-01), pages 19-28. IEEE Computer Society, 2001.
12. N. Shankar. Little engines of proof. In L.-H. Eriksson and P. Lindsay, editors, FME 2002: Formal Methods - Getting IT Right, pages 1-20, Copenhagen, 2002. Springer-Verlag.
13. N. Shankar and H. Rueß. Combining Shostak theories. In S. Tison, editor, Rewriting Techniques and Applications (RTA), volume 2378 of Lecture Notes in Computer Science, pages 1-19. Springer-Verlag, 2002.
14. R. E. Shostak. Deciding combinations of theories. Journal of the ACM, 31(1):1-12, 1984.
15. A. Stump, C. Barrett, and D. Dill. CVC: a Cooperating Validity Checker. In 14th International Conference on Computer-Aided Verification, 2002.
16. C. Tinelli and M. T. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In F. Baader and K. U. Schulz, editors, Frontiers of Combining Systems: Proceedings of the 1st International Workshop, Applied Logic, pages 103-120. Kluwer Academic Publishers, 1996.
17. A. Tiwari. Decision Procedures in Automated Deduction. PhD thesis, University of Stony Brook, 2000.