Abstract
A crucial point in proving theorems by induction is to manipulate the induction conclusion to enable the use of the induction hypothesis. We propose a technique to control such a deduction in a goal directed way: Comparing conclusion and hypothesis we obtain a syntactical pattern which has to be satisfied by each intermediate result of the deduction. To maintain this restriction we present a notion of terms and equations called C-terms resp. C-equations which we use as well to extend existing tactics for proof plans as to introduce new tactics.
This work was supported in part by the Sonderforschungsbereich 314 "Künstliche Intelligenz und Wissensbasierte Systeme" of the Deutsche Forschungsgemeinschaft.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
8. References
Aubin, R. Mechanizing Structural Induction, Theoretical Computer Science, vol. 9, 1979
Biundo, S., Hummel, B., Hutter, D. and Walther, C. The Karlsruhe Induction Theorem Proving System, Proceedings 8th CADE, Springer Lecture Notes Comp. Sc. vol. 230, 1986
Boyer, R.S. and Moore, J S. A computational Logic. Academic Press, 1979
Bundy, A. The Use of Explicit Plans to Guide Inductive Proofs, Proceedings 9th CADE, Springer Lecture Notes Comp. Sc. vol. 310, 1988
Goguen, J.A., Thatcher, J.W. and Wagner, E.G. An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types. In Current Trends in Programming Methodology, R.T. Yeh (Ed.), Prentice Hall, 1978.
Huet, G. and Oppen, D.C. Equations and Rewrite Rules: A survey. In: Formal Language Theory: Perspectives and Open Problems, R. Book (Ed.), Academic Press, 1980.
Hutter, D. Complete Induction. In: Deduction systems in artificial intelligence, Bläsius, K.H. and Bürckert, H.J. (Ed.), Ellis Horwood, 1989
Stevens, A. A Rational Reconstruction of Boyer and Moore's technique for constructing induction formulas. Proceedings of the 8th ECAI, 1988
Sonderforschungsbereich (SFB) 314 Arbeits-und Ergebnisbericht für die Jahre 1988–1990, Universität Karlsruhe, 1990
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hutter, D. (1990). Guiding induction 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_85
Download citation
DOI: https://doi.org/10.1007/3-540-52885-7_85
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