Compositionality Properties of SLD-Derivations
نویسندگان
چکیده
The paper introduces a semantics for definite logic programs expressed in term 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 [3,4].
منابع مشابه
Contributions à la sémantique de la programmation logique
This work can be split in two parts. First, we present a full formalisation of the semantics of de nite programs, in the calculus of inductive constructions. For this, we describe a formalisation of the proof of rst order terms uni cation obtained from a similar proof dealing with quasi-terms, thus showing in a general setting how partial functions can be considered in a system with total funct...
متن کاملA framework for computing finite SLD trees
The search space of SLD resolution, usually represented by means of a socalled SLD tree, is often infinite. However, there are many applications that must deal with possibly infinite SLD trees, like partial evaluation or some static analyses. In this context, being able to construct a finite representation of an infinite SLD tree becomes useful. In this work, we introduce a framework to constru...
متن کاملA Type-Theoretic Approach to Structural Resolution
Structural resolution (or S-resolution) is a newly proposed alternative to SLD-resolution that allows a systematic separation of derivations into term-matching and unification steps. Productive logic programs are those for which term-matching reduction on any query must terminate. For productive programs with coinductive meaning, finite term-rewriting reductions can be seen as measures of obser...
متن کاملAn Algebraic Theory
We give an algebraic formalization of SLD-trees and their abstractions (ob-servables). We can state and prove in the framework several useful theorems (AND-compositionality, correctness and full abstraction of the denotation, equivalent top-down and bottom-up constructions) about semantic properties of various observables. Observables are represented by Galois co-insertions and can be used to m...
متن کاملAn Algebraic Theory of Observables
We give an algebraic formalization of SLD-trees and their abstractions (ob servables). We can state and prove in the framework several useful theorems (AND-compositionality, correctness and full abstraction of the denotation, equivalent top-down and bottom-up constructions) about semantic properties of various observables. Observables are represented by Galois co-insertions and can be used to m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 211 شماره
صفحات -
تاریخ انتشار 1999