Compositionality properties of SLD-derivations

The paper introduces a semantics for definite logic programs expressed in terms of SLD-derivations and studies various properties of SLD-derivations by using the above semantics. The semantics of a program is a goal-independent denotation, which can equivalently be specified by a denotational semant...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science 1999-01, Vol.211 (1), p.275-309
Main Authors: Comini, Marco, Chiara Meo, Maria
Format: Article
Language:English
Subjects:
Compositionality
Logic programming
Semantics
SLD-derivations
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper introduces a semantics for definite logic programs expressed in terms of SLD-derivations and studies various properties of SLD-derivations by using the above semantics. The semantics of a program is a goal-independent denotation, which can equivalently be specified by a denotational semantics and a transition system. The denotation is proved to be correct, minimal, AND-compositional and OR-compositional. The denotational semantics and the transition system are defined in terms of a set of primitive semantic operators, whose properties are directly related to the properties of the denotation. The SLD-derivations semantics has been designed to act as collecting semantics for a framework of abstract semantics (Comini et al., 1995, 1996).
ISSN:0304-3975
1879-2294
DOI:10.1016/S0304-3975(97)00174-6