A rational reconstruction and extension of recursion analysis

Authors:
Alan Bundy;Frank Van Harmelen;Jane Hesketh;Alan Smaill;Andrew Stevens
Affiliations:
Department of Artificial Intelligence, University of Edinburgh, Edinburgh, Scotland;Department of Artificial Intelligence, University of Edinburgh, Edinburgh, Scotland;Department of Artificial Intelligence, University of Edinburgh, Edinburgh, Scotland;Department of Artificial Intelligence, University of Edinburgh, Edinburgh, Scotland;Department of Artificial Intelligence, University of Edinburgh, Edinburgh, Scotland
Venue:
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Year:
1989

Citing 2
Cited 1

Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
The Use of Explicit Plans to Guide Inductive Proofs

Proceedings of the 9th International Conference on Automated Deduction

Strategic Issues, Problems and Challenges in Inductive Theorem Proving

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.