Superposition modulo a Shostak theory

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

Volumn 2741, Issue , 2003, Pages 182-196

  Ganzinger, Harald ^a   Hillenbrand, Thomas ^a   Waldmann, Uwe ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; METALS; SEMANTICS; SUBROUTINES; THEOREM PROVING; ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; PROBLEM SOLVING;

EQUATIONAL REASONING; PROGRAM SEMANTICS; PROGRAM VERIFICATION; SHOSTAK THEORIES; AMALGAMATION; FREE THEORY; SHOSTAK THEORY T; SUPERPOSITION MODULO;

CALCULATIONS; PROGRAMMING THEORY;

EID: 7044268970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45085-6_15     Document Type: Conference Paper

References (22)

1. L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217–247, 1994
2. L. Bachmair, H. Ganzinger, and U. Waldmann. Refutational theorem proving for hierarchic first-order theories. Applicable Algebra in Engineering, Communication and Computing, 5(3/4):193–212, 1994
3. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998
4. H.-J. Bürckert. A resolution principle for clauses with constraints. In M. E. Stickel, editor, Proceedings of the 10th International Conference on Automated Deduction, volume 449 of LNAI, pages 178–192. Springer-Verlag, 1990
5. H. Ganzinger. Shostak light. In A. Voronkov, editor, Proceedings of the 18th International Conference on Automated Deduction, volume 2392 of LNAI, pages 332–346. Springer-Verlag, 2002
6. H. Ganzinger, Th. Hillenbrand, and U. Waldmann. Superposition modulo a Shostak theory. Technical report, Max-Planck-Institut für Informatik, Saarbrücken, 2003
7. G. Godoy and R. Nieuwenhuis. Paramodulation with built-in abelian groups. In Proceedings of the 15th IEEE Symposium on Logic in Computer Science, pages 413–424. IEEE Computer Society Press, 2000
8. J.-P. Jouannaud and C. Marché. Termination and completion modulo associativity, commutativity and identity. Theoretical Computer Science, 104(1):29–51, 1992
9. D. Kapur. A rewrite rule based framework for combining decision procedures. In A. Armando, editor, Proceedings of the 4th International Workshop on Frontiers of Combining Systems, volume 2309 of LNAI, pages 87–102. Springer-Verlag, 2002
10. S. Krstić and S. Conchon. Canonization for disjoint unions of theories. In Proceedings of the 19th International Conference on Automated Deduction, LNAI. Springer-Verlag, 2003. This volume
11. Ph. Le Chenadec. Canonical Forms in Finitely Presented Algebras. John Wiley & Sons, 1986
12. C. Marché. Normalised rewriting and normalised completion. In Proceedings of the 9th IEEE Symposium on Logic in Computer Science, pages 394–403. IEEE Computer Society Press, 1994
13. A. Middeldorp and H. Zantema. Simple termination revisited. In Proceedings of the 12th International Conference on Automated Deduction, volume 814 of LNAI, pages 451–465. Springer-Verlag, 1994
14. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245–257, 1979
15. R. Nieuwenhuis and A. Rubio. Paramodulation-based theorem proving. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 7, pages 371–443. Elsevier, 2001
16. G. D. Plotkin. Building-in equational theories. In B. Meltzer and D. Michie, editors, Machine Intelligence 7, chapter 4, pages 73–90. American Elsevier, 1972
17. H. Rueß and N. Shankar. Deconstructing Shostak. In Proceedings of the 16th IEEE Symposium on Logic in Computer Science, pages 19–28. IEEE Computer Society Press, 2001
18. R. E. Shostak. Deciding combinations of theories. Journal of the ACM, 31(1):1–12, 1984
19. N. Shankar and H. Rueß. Combining Shostak theories. In S. Tison, editor, Proceedings of the 13th International Conference on Rewriting Techniques and Applications, volume 2378 of LNCS, pages 1–18. Springer-Verlag, 2002
20. M. E. Stickel. Automated deduction by theory resolution. Journal of Automated Reasoning, 1(4):333–355, 1985
21. J. Stuber. Deriving theory superposition calculi from convergent term rewriting systems. In L. Bachmair, editor, Proceedings of the 11th International Conference on Rewriting Techniques and Applications, volume 1833 of LNCS, pages 229–245. Springer-Verlag, 2000
22. U. Waldmann. Cancellative abelian monoids and related structures in refutational theorem proving (Part I). Journal of Symbolic Computation, 33(6):777–829, 2002