A Rational Reconstruction and Extension of Recursion Analysis
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Automated Deduction. Pages 359-364.
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 CLAMOyster system.
@inproceedings{ijcai1989p57,
title = {A Rational Reconstruction and Extension of Recursion Analysis},
author = {Bundy, Alan and van Harmelen, Frank and Hesketh, Jane and Smaill, Alan and Stevens, Andrew},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {359--364},
year = {1989},
month = {8},
note = {Automated Deduction},
url = {https://ijcai.org/proceedings/1989/57},
}
TY - CPAPER TI - A Rational Reconstruction and Extension of Recursion Analysis AU - Bundy, Alan AU - van Harmelen, Frank AU - Hesketh, Jane AU - Smaill, Alan AU - Stevens, Andrew T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 359 EP - 364 UR - https://ijcai.org/proceedings/1989/57 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: