Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
5. References
COHEN, B.L. (1978): "A Theory of Structural Concept Formation and Pattern Recognition". Ph.D. Thesis, Dept. of Computer Science, University of N.S.W.
KOWALSKI, R.A. (1974): "Predicate Logic as a Programming Language". 1974 IFIP Congress.
RULIFSON J.F., DERKSEN J.A., WALDINGER R.L. (1972): "QA4: A Procedural Calculus for Intuitive Reasoning". S.R.I. Artificial Intelligence Center, Technical Note 73. (Note: QLISP was originally known as QA4).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sammut, C., Cohen, B. (1980). A language for describing concepts as programs. In: Tobias, J.M. (eds) Language Design and Programming Methodology. LDPM 1979. Lecture Notes in Computer Science, vol 79. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09745-7_8
Download citation
DOI: https://doi.org/10.1007/3-540-09745-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09745-7
Online ISBN: 978-3-540-38579-0
eBook Packages: Springer Book Archive