@emanuel

A Class of Functions Synthesized from a Finite Number of Examples and a LISP Program Scheme

. 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.

Description

SpringerLink - Zeitschriftenbeitrag

Links and resources

Tags

community