Guiding induction proofs
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.
Unable to display preview. Download preview PDF.
- Aubin, R. Mechanizing Structural Induction, Theoretical Computer Science, vol. 9, 1979Google Scholar
- 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, 1986Google Scholar
- Boyer, R.S. and Moore, J S. A computational Logic. Academic Press, 1979Google Scholar
- Bundy, A. The Use of Explicit Plans to Guide Inductive Proofs, Proceedings 9th CADE, Springer Lecture Notes Comp. Sc. vol. 310, 1988Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- Hutter, D. Complete Induction. In: Deduction systems in artificial intelligence, Bläsius, K.H. and Bürckert, H.J. (Ed.), Ellis Horwood, 1989Google Scholar
- Stevens, A. A Rational Reconstruction of Boyer and Moore's technique for constructing induction formulas. Proceedings of the 8th ECAI, 1988Google Scholar
- Sonderforschungsbereich (SFB) 314 Arbeits-und Ergebnisbericht für die Jahre 1988–1990, Universität Karlsruhe, 1990Google Scholar