{"type":"ScholarlyArticle","title":"A Rational Reconstruction and Extension of Recursion Analysis","authors":[{"name":"Alan Bundy","slug":"alan-bundy","given":"Alan","family":"Bundy","affiliation":""},{"name":"Frank van Harmelen","slug":"frank-van-harmelen","given":"Frank","family":"van Harmelen","affiliation":""},{"name":"Jane Hesketh","slug":"jane-hesketh","given":"Jane","family":"Hesketh","affiliation":""},{"name":"Alan Smaill","slug":"alan-smaill","given":"Alan","family":"Smaill","affiliation":""},{"name":"Andrew Stevens","slug":"andrew-stevens","given":"Andrew","family":"Stevens","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1989/57","pdf":"https://ijcai.org/proceedings/1989/0057.pdf","markdown":"https://ijcai.org/proceedings/1989/57.md","bibtex":"https://ijcai.org/proceedings/1989/bibtex/57","volume":{"slug":"1989","title":"Proceedings of the Eleventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1989","url":"https://ijcai.org/proceedings/1989/","year":1989,"location":"Detroit, Michigan, USA","dates":"August 20-25 1989","editors":"N. S. Sridharan","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Deduction","track":"Automated Deduction","number":57,"pages":{"first":359,"last":364},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}