A Class of Functions Synthesized from a Finite Number of Examples and a LISP Program Scheme
Y. Kodratoff. International Journal of Computer and Information Sciences, 8 (6):
489--521(1979)
Abstract
We define a class of functions that can be synthesized from example problems. The algorithmic representation of these functions is the interpretation of a given scheme. The instantiation of the scheme variables is realized by a new method which uses pattern matching then if necessary generalization and further pattern matching. One can compute the number of examples necessary to characterize in a unique way a function of this class.
%0 Journal Article
%1 Kodratoff79
%A Kodratoff, Yves
%D 1979
%J International Journal of Computer and Information Sciences
%K analytical_ip ifp induction inductive_programming program_synthesis synthesis_from_traces
%N 6
%P 489--521
%T A Class of Functions Synthesized from a Finite Number of Examples and a LISP Program Scheme
%U http://dx.doi.org/10.1007/BF00995500
%V 8
%X We define a class of functions that can be synthesized from example problems. The algorithmic representation of these functions is the interpretation of a given scheme. The instantiation of the scheme variables is realized by a new method which uses pattern matching then if necessary generalization and further pattern matching. One can compute the number of examples necessary to characterize in a unique way a function of this class.
@article{Kodratoff79,
abstract = {We define a class of functions that can be synthesized from example problems. The algorithmic representation of these functions is the interpretation of a given scheme. The instantiation of the scheme variables is realized by a new method which uses pattern matching then if necessary generalization and further pattern matching. One can compute the number of examples necessary to characterize in a unique way a function of this class.},
added-at = {2008-05-16T16:52:04.000+0200},
author = {Kodratoff, Yves},
biburl = {https://www.bibsonomy.org/bibtex/24a9a45a5d0a0749a65e7516742e5de78/emanuel},
description = {SpringerLink - Zeitschriftenbeitrag},
interhash = {a3de805b49269bf75432dbf8c03e1ca2},
intrahash = {4a9a45a5d0a0749a65e7516742e5de78},
journal = {International Journal of Computer and Information Sciences},
keywords = {analytical_ip ifp induction inductive_programming program_synthesis synthesis_from_traces},
number = 6,
pages = {489--521},
timestamp = {2008-05-16T16:52:05.000+0200},
title = {A Class of Functions Synthesized from a Finite Number of Examples and a {LISP} Program Scheme},
url = {http://dx.doi.org/10.1007/BF00995500},
volume = 8,
year = 1979
}