Generalization Heuristics for Theorems Related to Recursively Defined Functions
Abstract
This paper is concerned with the problem of generalizing theorems about recursively defined functions, so as to make these theorems amenable to proof by induction. Some generalization heuristics are presented for certain special forms of theorems about functions specified by certain recursive schemas. The heuristics are based upon the analysis of computational sequences associated with the schemas. If applicable, the heuristics produce generalizations that are guaranteed to be theorems.
Cite
Text
Abdali and Vytopil. "Generalization Heuristics for Theorems Related to Recursively Defined Functions." AAAI Conference on Artificial Intelligence, 1984.Markdown
[Abdali and Vytopil. "Generalization Heuristics for Theorems Related to Recursively Defined Functions." AAAI Conference on Artificial Intelligence, 1984.](https://mlanthology.org/aaai/1984/abdali1984aaai-generalization/)BibTeX
@inproceedings{abdali1984aaai-generalization,
title = {{Generalization Heuristics for Theorems Related to Recursively Defined Functions}},
author = {Abdali, S. Kamal and Vytopil, Jan},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1984},
pages = {1-5},
url = {https://mlanthology.org/aaai/1984/abdali1984aaai-generalization/}
}