A language for describing concepts as programs

  • Claude Sammut
  • Brian Cohen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 79)


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.


Boolean Function Function Return Learning Program Predicate Logic Logical Expression 
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

  1. 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.Google Scholar
  2. KOWALSKI, R.A. (1974): "Predicate Logic as a Programming Language". 1974 IFIP Congress.Google Scholar
  3. 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).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Claude Sammut
    • 1
  • Brian Cohen
    • 1
  1. 1.Department of Computer ScienceUniversity of New South WalesAustralia

Personalised recommendations