Representation and Induction of Infinite Concepts and Recursive Action Sequences
Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Learning and Knowledge Acquisition. Pages 409-413.
Abstract
A general method for the inference of recursive functions (programs) from examples of computations is described. It is based on the so called algebraic semantics of recursive program schemes and in this paper mainly applied to the representation and induction of infinite concepts and recursive action sequences (which are of importance for problem solving and hierarchical planning). Additionally, the use of recursive program schemes leads to a new principle of generalization in the sense that families of structures or classes of programs could be treated simultaneously and that already existing solutions of old problems could be transferred to new problems which have to be solved.
@inproceedings{ijcai1983p99,
title = {Representation and Induction of Infinite Concepts and Recursive Action Sequences},
author = {Wysotzki, Fritz},
booktitle = {Proceedings of the Eighth International Joint Conference on
Artificial Intelligence, {IJCAI-83}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Alan Bundy},
pages = {409--413},
year = {1983},
note = {Learning and Knowledge Acquisition},
url = {https://ijcai.org/proceedings/1983/99},
}
TY - CPAPER TI - Representation and Induction of Infinite Concepts and Recursive Action Sequences AU - Wysotzki, Fritz T2 - Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83 PB - International Joint Conferences on Artificial Intelligence PY - 1983 SP - 409 EP - 413 UR - https://ijcai.org/proceedings/1983/99 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
