Conditional equational specifications of data types with partial operations for inductive theorem proving

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

Volumn 1232, Issue , 1997, Pages 38-52

  Kühler, Ulrich ^a   Wirth, Claus Peter ^a  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; SPECIFICATION LANGUAGES; SPECIFICATIONS;

DATA ITEMS; DATA TYPE; EQUATIONAL SPECIFICATIONS; INDUCTIVE THEOREM PROVING; POSITIVE/NEGATIVE;

THEOREM PROVING;

EID: 84947770521     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62950-5_60     Document Type: Conference Paper

References (16)

1. J. Avenhaus and K. Madlener. Theorem proving in hierarchical clausal specifications. SEKI-Report SR-95-14, FB Informatik, Universität Kaiserslautern, 1995.
2. J. A. Bergstra and J. W. Klop. Conditional rewrite rules: Confluence and termination. J. Computer and System Sei., 32:323-362, 1986.
3. A. Bouhoula and M. Rusinowitch. Implicit induction in conditional theories. J. Automated Reasoning, 14:189-235, 1995.
4. R. Boyer and J Moore. A Computational Logic. Academic Press, 1979.
5. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Handbook of Theoretical Computer Science, pages 243-320. Elsevier Science Publishers B. V., 1990.
6. st CTRS, volume 308 of LNCS, pages 31-44. Springer, 1988.
7. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification. Springer, 1985.
8. th CADE, volume 1104 of LNAI, pages 288-292. Springer, 1996.
9. D. Kapur and M. Subramaniam. New uses of linear arithmetic in automated theorem proving by induction. J. Automated Reasoning, 16:39-78, 1996.
10. U. Kühler and C.-P. Wirth. Conditional equational specifications of data types with partial operations for inductive theorem proving. SEKI-Report SR-96-11, FB Informatik, Universität Kaiserslautern, 1996.
11. D. A. Plaisted. Semantic confluence tests and completion methods. Information and Control, 65:182-215, 1985.
12. M. Wirsing. Algebraic specification. In Handbook of Theoretical Computer Science, pages 675-788. Elsevier Science Publishers B. V., 1990.
13. C.-P. Wirth. Syntactic confluence criteria for positive/negative-conditional term rewriting systems. SEKI-Report SR-95-09, FB Informatik, Universität Kaiserslautern, 1995.
14. C.-P. Wirth and B. Grämlich, A constructor-based approach to positive/negative- conditional equational specifications. J. Symbolic Computation, 17:51-90, 1994.
15. th CADE, volume 814 of LNAI, pages 162-176. Springer, 1994.
16. C.-P. Wirth and U. Kühler. Inductive theorem proving in theories specified by positive/negative-conditional equations. SEKI-Report SR-95-15, FB Informatik, Universität Kaiserslautern, 1995.