Extensions to the rippling-out tactic for guiding inductive proofs
In earlier papers we described a technique for automatically constructing inductive proofs, using a heuristic search control tactic called rippling-out. Further testing on harder examples has shown that the rippling-out tactic significantly reduces the search for a proof of a wide variety of theorems, with relatively few cases in which all proofs were pruned. However, it also proved necessary to generalise and extend rippling-out in various ways. Each of the various extensions are described with examples to illustrate why they are needed, but it is shown that the spirit of the original rippling-out tactic has been retained.
KeywordsInduction Hypothesis Wave Front Inductive Proof Induction Variable Recursive Definition
Unable to display preview. Download preview PDF.
- [Aubin 75]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.Google Scholar
- [Boyer & Moore 79]R.S. Boyer and J.S. Moore. A Computational Logic. Academic Press, 1979. ACM monograph series.Google Scholar
- [Bundy 88]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.Google Scholar
- [Bundy et al 88]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.Google Scholar
- [Constable et al 86]R.L. Constable, S.F. Allen, H.M. Bromley, et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall, 1986.Google Scholar