The programming language GCLA: A definitional approach to logic programming
Number of Authors: 5
1989 (English)Report (Refereed)
We present a logic programming language, GCLA (Generalized horn Clause LAnguage), that is based on a generalization of Prolog. This generalization is unusual in that it takes a quite different view of the meaning of a logic program--a "definitional" view rather than the traditional logical view. GCLA has a number of noteworthy properties, for instance hypothetical and non-monotonic reasoning. This makes implementation of reasoning in knowledge-based systems more direct in GCLA than in Prolog. GCLA is also general enough to incorporate functional programming as a special case. GCLA and its syntax and semantics are described. The use of various language constructs are illustrated with several examples.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1989, 1. , 26 p.
SICS Research Report, ISSN 0283-3638 ; R89:05B
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22185OAI: oai:DiVA.org:ri-22185DiVA: diva2:1041729
Revised version of R89005. Original report number R89005B.2016-10-312016-10-312017-04-07Bibliographically approved