How to Prove Inductive Theorems? QuodLibet!-Reference-Cited by-同舟云学术

How to Prove Inductive Theorems? QuodLibet!

Published:2003 Issue: Volume: Page:328-333
ISSN:0302-9743
Container-title:Automated Deduction – CADE-19
language:
Short-container-title:

Author:

Avenhaus Jürgen,Kühler Ulrich,Schmidt-Samoa Tobias,Wirth Claus-Peter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-45085-6_29

Reference9 articles.

1. Bachmair, L.: Proof By Consistency in Equational Theories. In: 3rd IEEE symposium on Logic In Computer Sci., pp. 228–233. IEEE Press, Los Alamitos (1988)

2. Boyer, R.S., Strother Moore, J.: A Computational Logic Handbook. Academic Press, London (1988)

3. Kapur, D., Musser, D.R., Nie, X.: An Overview of the Tecton Proof System. Theoretical Computer Sci. 133, 307–339 (1994)

4. Kühler, U.: A Tactic-Based Inductive Theorem Prover for Data Types with Partial Operations. Ph.D. thesis, Infix, Sankt Augustin (2000)

5. Lecture Notes in Computer Science;U. Kühler,1997

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions;Journal of Logic and Computation;2023-12-07

2. , , and Non-Permutability of -Steps;Journal of Symbolic Computation;2012-09

3. A Generic Cyclic Theorem Prover;Programming Languages and Systems;2012

4. ΩMEGA: Resource-Adaptive Processes in an Automated Reasoning System;Resource-Adaptive Cognitive Processes;2010

5. A Generic Modular Data Structure for Proof Attempts Alternating on Ideas and Granularity;Lecture Notes in Computer Science;2006