Inductive Decidability Using Implicit Induction-Reference-Cited by-同舟云学术

Inductive Decidability Using Implicit Induction

Published:2006 Issue: Volume: Page:45-59
ISSN:0302-9743
Container-title:Logic for Programming, Artificial Intelligence, and Reasoning
language:
Short-container-title:

Author:

Falke Stephan,Kapur Deepak

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11916277_4.pdf

Reference20 articles.

1. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

2. Bachmair, L.: Proof by consistency in equational theories. In: Proc. LICS 1988, pp. 228–233 (1988)

3. Lecture Notes in Computer Science;T. Ball,2001

4. Bouhoula, A.: Automated theorem proving by test set induction. Journal of Symbolic Computation 23(1), 47–77 (1997)

5. Falke, S., Kapur, D.: Implicit induction methods and decision procedures. Technical Report TR-CS-2006-04, Department of Computer Science, University of New Mexico (2006), Available at: http://www.cs.unm.edu/research/

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

1. Over-Approximating Terms Reachable by Context-Sensitive Rewriting;Lecture Notes in Computer Science;2015

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. Rewriting Induction + Linear Arithmetic = Decision Procedure;Automated Reasoning;2012

4. On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs;Functional and Constraint Logic Programming;2011

5. Superposition for fixed domains;ACM Transactions on Computational Logic;2010-07