Advertisement

Extensions to the rippling-out tactic for guiding inductive proofs

  • Alan Bundy
  • Frank van Harmelen
  • Alan Smaill
  • Andrew Ireland
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 449)

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.

Keywords

Induction Hypothesis Wave Front Inductive Proof Induction Variable Recursive Definition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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
  2. [Boyer & Moore 79]
    R.S. Boyer and J.S. Moore. A Computational Logic. Academic Press, 1979. ACM monograph series.Google Scholar
  3. [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
  4. [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
  5. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Alan Bundy
    • 1
  • Frank van Harmelen
    • 1
  • Alan Smaill
    • 1
  • Andrew Ireland
    • 1
  1. 1.Department of Artificial IntelligenceUniversity of EdinburghEdinburghScotland

Personalised recommendations