Extensions to the rippling-out tactic for guiding inductive proofs-Reference-Cited by-同舟云学术

Extensions to the rippling-out tactic for guiding inductive proofs

Published:1990 Issue: Volume: Page:132-146
ISSN:0302-9743
Container-title:10th International Conference on Automated Deduction
language:
Short-container-title:

Author:

Bundy Alan,Harmelen Frank,Smaill Alan,Ireland Andrew

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-52885-7_84.pdf

Reference5 articles.

1. R. Aubin. Some generalization heuristics in proofs by induction. In Actes du Colloque Construction: Amelioration et verification de Programmes, Institut de recherche d'informatique et d'automatique, 1975.

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

3. A. Bundy. The use of explicit plans to guide inductive proofs. In 9th Conference on Automated Deduction, pages 111–120, Springer-Verlag, 1988. Longer version available from Edinburgh as Research Paper No. 349.

4. A. Bundy, F. van Harmelen, J. Hesketh, and A. Smaill. Experiments with Proof Plans for Induction. Research Paper 413, Dept. of Artificial Intelligence, Edinburgh, 1988. To appear in JAR.

5. R.L. Constable, S.F. Allen, H.M. Bromley, et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall, 1986.

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

1. Adventures in Mathematical Reasoning;Mathematical Reasoning: The History and Impact of the DReaM Group;2021

2. Proving inductive validity of constrained inequalities;Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming;2016-09-05

3. Concepts in Proof Planning;Applied Logic Series;2000

4. Matrix-Based Inductive Theorem Proving;Lecture Notes in Computer Science;2000

5. Instantiation of existentially quantified variables in inductive specification proofs;Artificial Intelligence and Symbolic Computation;1998