SODA

GCLA II - A definitional approach to control

Kreuger, Per (1990) GCLA II - A definitional approach to control. Licentiate thesis, University of Göteborg.

Full text not available from this repository.

Abstract

This paper describes the logic programming language GCLA II, its operational semantics and parts of its theoretical foundations. GCLA II is a generalization of the language GCLA (Generalized Horn Clause Language) augmented by a method to guide and constrain proof search. The method is based on specification of strategies in a meta language that is a sub language of GCLA itself. A GCLA II program is partitioned into two distinct parts. One is used to express the declarative content of the program, while the other is used to define the possible inferences made from this declarative knowledge. Although the intended use of the declarative part and the procedural parts are quite different, they can both be described in the formalism of partial inductive definitions. Thus we preserve a declarative reading of the program as a whole. In particular, given certain syntactical constraints on the program, the heuristics associated with proof search does not affect the declarative reading of the declarative part of the program at all. Several experimental interpreters and a compiler from GCLA II to Prolog have been implement ed.

Item Type:Thesis (Licentiate)
Additional Information:Also published as SICS Research Report R92:09 and in Eriksson, L.-H., Hallnäs, L. and Schroeder-Heister, P., eds., it Extensions of Logic Programming - ELP'91: Proceedings of the second international workshop on extensions of logic programming, volume 596 of Lecture notes on Artificial Intelligence, pages 239-297, Stockholm, Sweden 1991,January 1991, Springer Verlag
ID Code:574
Deposited By:IAM Researcher
Deposited On:04 May 2007
Last Modified:18 Nov 2009 15:56

Repository Staff Only: item control page