| 1. |
|
|
| 2. |
- Aronsson, Martin
(författare)
-
GAM: An abstract machine for GCLA
- 1989. - 1
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- GCLA is a new programming language, which increases expressiveness compared with traditional logic programming languages and functional programming languages. The basis for the language is a generalization of the concept inductive definitions, called partial inductive definitions. The program defines a logic, which is used to make inferences to prove if a query holds or not. This report first presents a short introduction to these ideas. Then, an abstract machine, called GAM, for GCLA is presented; the instructions as well as an introduction to the compiling schema is given together with some examples. The main idea is to extend the Warren Abstract Machine (WAM), which is an abstract machine for the language Prolog.
|
|
| 3. |
|
|
| 4. |
|
|
| 5. |
- Aronsson, Martin
(författare)
-
STRIPS-Like planning using GCLA
- 1989. - 1
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- This report describes how a STRIPS planning system can be implemented in GCLA. A short introduction to the problem of the blocks world is given, as well as an introduction to STRIPS. Then the GCLA program implementing the planning system is presented, together with queries concerning planning and simulation problems.
|
|
| 6. |
- Aronsson, Martin
(författare)
-
The Instruction Set for the GCLA Abstract Machine
- 1989. - 1
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- The basis for the language GCLA is a generalization of the concept inductive definitions, called partial inductive definitions. The program defines a logic, which is used to make inferences to prove if a query holds or not. This report first presents a short introduction to these ideas. Then, an abstract machine, called GAM, for GCLA is presented; the instructions as well as an introduction to the compiling schema is given together with some examples. The GAM instructions are also presented as transitions in an appendix.
|
|
| 7. |
- Aronsson, Martin, et al.
(författare)
-
The programming language GCLA: A definitional approach to logic programming
- 1989. - 1
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- 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.
|
|
