Decidable Classes of Inductive Theorems-Reference-Cited by-同舟云学术

Decidable Classes of Inductive Theorems

Published:2001 Issue: Volume: Page:469-484
ISSN:0302-9743
Container-title:Automated Reasoning
language:
Short-container-title:

Author:

Giesl Jürgen,Kapur Deepak

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45744-5_41

Reference11 articles.

1. F. Baader & T. Nipkow, Term Rewriting and All That, Cambridge Univ. Pr., 1998.

2. R. S. Boyer and J Moore, A Computational Logic, Academic Press, 1979.

3. A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, & A. Smaill, Rippling: A Heuristic for Guiding Inductive Proofs, Artificial Intelligence, 62:185–253, 1993.

4. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, & M. Tommasi. Tree Automata and Applications. Draft, available from http://www.grappa.univ-lille3.fr/tata/ , 1999.

5. N. Dershowitz, Termination of Rewriting, J. Symb. Comp., 3:69–116, 1987.

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

1. Variant-Based Satisfiability in Initial Algebras;Communications in Computer and Information Science;2016

2. Decision Procedures for Proving Inductive Theorems without Induction;Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming - PPDP '14;2014

3. A Tableaux-Based Decision Procedure for Multi-parameter Propositional Schemata;Lecture Notes in Computer Science;2014

4. Validity Checking of Putback Transformations in Bidirectional Programming;Lecture Notes in Computer Science;2014

5. Combining Superposition and Induction: A Practical Realization;Frontiers of Combining Systems;2013