The programming language GCLA — A definitional approach to logic programming | Zendy

Martin Aronsson | Zendy; Lars-Henrik Eriksson | Zendy; Anette Gäredal | Zendy; Lars Hallnäs | Zendy; Peter M. Olin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The programming language GCLA — A definitional approach to logic programming

Author(s) -

Martin Aronsson,

Lars-Henrik Eriksson,

Anette Gäredal,

Lars Hallnäs,

Peter M. Olin

Publication year - 1990

Publication title -

new generation computing

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.277

H-Index - 27

eISSN - 1882-7055

pISSN - 0288-3635

DOI - 10.1007/bf03037453

Subject(s) - computer science , prolog , programming language , horn clause , logic programming , functional logic programming , generalization , fifth generation programming language , syntax , semantics (computer science) , inductive programming , artificial intelligence , programming paradigm , mathematics , mathematical analysis

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research