A Rational Reconstruction and Extension of Recursion Analysis
暂无分享,去创建一个
The focus of this paper is the technique of recursion analysis. Recursion analysis is used by the Boyer-Moore Theorem Prover to choose an appropriate induction schema and variable to prove theorems by mathematical induction. A rational reconstruction of recursion analysis is outlined, using the technique of proof plans. This rational reconstruction suggests an extension of recursion analysis which frees the induction suggestion from the forms of recursion found in the conjecture. Preliminary results are reported of the automation of this rational reconstruction and extension using the CLAM-Oyster system.
[1] Rance Cleaveland,et al. Implementing mathematics with the Nuprl proof development system , 1986 .
[2] Andrew Stevens. A Rational Reconstruction of Boyer and Moore's Technique for Constructing Induction Formulas , 1988, ECAI.
[3] Alan Bundy,et al. The Use of Explicit Plans to Guide Inductive Proofs , 1988, CADE.
[4] Robert S. Boyer,et al. Computational Logic , 1990, ESPRIT Basic Research Series.