A learning program produces, as its output, a boolean function which describes a concept. The function returns true if and only if the argument is an object which satisfies the logical expression in the body of the function. The learning program's input is a set of objects which are instances of the concept to be learnt. A compiler/interpreter has been written which performs the reverse of the learning process. The concept description is regarded as a program which defines the set of objects which satisfy the given conditions. The interpreter takes as its input, a predicate and produces as its output, an object which belongs to the set.
CITATION STYLE
Sammut, C., & Cohen, B. (1980). A language for describing concepts as programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 79 LNCS, pp. 111–116). Springer Verlag. https://doi.org/10.1007/3-540-09745-7_8
Mendeley helps you to discover research relevant for your work.