Skip to main content
SpringerLink
Log in

Lazy generation of induction hypotheses

  • Conference paper
  • First Online:
Automated Deduction — CADE-12 (CADE 1994)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 814))

Included in the following conference series:

Abstract

A novel approach for automating explicit induction is suggested. Analysis of successful induction proofs reveals that these proofs can be guided without reference to a specific induction axiom. This means that required induction hypotheses can be computed during the proof. We show that some instances of the generalized induction scheme provide induction hypotheses which cannot be obtained using common techniques. Our proposal also leads to an extension of known strategies to guide induction proofs. Criteria are developed which justify the soundness of the computed induction axioms without requiring additional proofs. The performance of the new technique is illustrated by some non-trivial problems for which necessary induction hypotheses are generated automatically.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Aubin, Mechanizing Structural Induction. Theoretical Computer Science, vol. 9, 329–362, 1979.

    Google Scholar 

  2. R.S. Boyer, J S. Moore, A Computational Logic. Academic Press, 1979.

    Google Scholar 

  3. A. Bundy et al., Rippling: A Heuristic for Guiding Inductive Proofs. Artificial Intelligence, vol. 62, no. 2, 185–253, August 1993.

    Google Scholar 

  4. G. Huet, The Gilbreath Trick: A Case Study in Axiomatization and Proof Development in the COQ Proof Assistant, Technical Report 1511, INRIA, 1991.

    Google Scholar 

  5. D. Hutter, Guiding Induction Proofs. Proc. 10th Conf. on Automated Deduction, Kaiserslautern, 147–161, Springer LNAI vol. 449, 1990.

    Google Scholar 

  6. C. Walther, Argument-Bounded Algorithms as a Basis for Automated Termination Proofs, Proc. 9th Conference on Automated Deduction, Argonne, Springer LNAI vol. 310, 1988. Revised version to appear as “On Proving the Termination of Algorithms by Machine” in AI Journal, 1994.

    Google Scholar 

  7. C. Walther, Computing Induction Axioms, Proc. Conference on Logic Programming and Automated Reasoning, St. Petersburg, Springer LNCS vol. 624, 1992.

    Google Scholar 

  8. C. Walther, Combining Induction Axioms by Machine, Proc. Int. Joint Conference on Artificial Intelligence, Chambery, 95–101, Morgan Kaufmann Publishers, 1993.

    Google Scholar 

  9. C. Walther, Mathematical Induction. In: D.M. Gabbay, C.J. Hogger & J.A. Robinson (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 2, Oxford University Press, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Technische Hochschule Darmstadt, Alexanderstr. 10, D-64283, Darmstadt, Germany

    Martin Protzen

Authors
  1. Martin Protzen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alan Bundy

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Protzen, M. (1994). Lazy generation of induction hypotheses. In: Bundy, A. (eds) Automated Deduction — CADE-12. CADE 1994. Lecture Notes in Computer Science, vol 814. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58156-1_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-58156-1_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58156-7

  • Online ISBN: 978-3-540-48467-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation