Abstract
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.
The research reported in this paper was supported by SERC grant GR/E/44598, and an SERC Senior Fellowship to the first author. We wish to thank our colleagues in the Edinburgh Mathematical Reasoning Group and three anonymous referees for feedback on this paper.
Preview
Unable to display preview. Download preview PDF.
References
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.
R.S. Boyer and J.S. Moore. A Computational Logic. Academic Press, 1979. ACM monograph series.
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.
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.
R.L. Constable, S.F. Allen, H.M. Bromley, et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bundy, A., van Harmelen, F., Smaill, A., Ireland, A. (1990). Extensions to the rippling-out tactic for guiding inductive proofs. In: Stickel, M.E. (eds) 10th International Conference on Automated Deduction. CADE 1990. Lecture Notes in Computer Science, vol 449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52885-7_84
Download citation
DOI: https://doi.org/10.1007/3-540-52885-7_84
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52885-2
Online ISBN: 978-3-540-47171-4
eBook Packages: Springer Book Archive