The coincidence of the declarative and procedural interpretations of logic programs does not apply to Prolog programs, due to the depth-first left-to-right evaluation strategy of Prolog interpreters. We propose a semantics for Prolog programs based on a four-valued logic. The semantics is based on a new concept of completion analogous to Clark's and it enjoys the nice properties of the declarative semantics of logic programming: existence of the least Herbrand model, equivalence of the model-theoretic and operational semantics. (C) 1998 Elsevier Science B.V. All rights reserved
We extend the abstract interpretation point of view on context-free grammars by Cousot and Cousot to...
AbstractCerrito (1990) has proposed a declarative semantics for allowed logic programs using Girard'...
AbstractMany studies [1, 7, 20, 21, 26, 28] have shown the soundness and completeness of SLD-resolut...
AbstractThe coincidence of the declarative and procedural interpretations of logic programs does not...
AbstractThree semantics have been proposed as the most promising candidates for a declarative interp...
The authors present semantics for logic programs using term rewrite systems. Reading program lines f...
AbstractA sound and complete semantics is given for sequential, depth-first logic programming with a...
The goal of this paper is to construct a semantic basis for the abstract interpretation of Prolog pr...
The goal of this paper is to construct a semantic basis for the abstract interpretaion of Prolog pro...
AbstractThis paper proposes to specify semantic definitions for logic programming languages such as ...
This paper proposes to specify semantic definitions for logic programming languages such as Prolog i...
AbstractWe define a semantics for negation as failure in logic programming. Our semantics may be vie...
The paper defines a new declarative semantics for logic programs, which is based on interpretations ...
AbstractIn this paper, we define a framework in which the termination of Prolog programs can be prov...
One of the most important and difficult problems in logic programming is the problem of finding a su...
We extend the abstract interpretation point of view on context-free grammars by Cousot and Cousot to...
AbstractCerrito (1990) has proposed a declarative semantics for allowed logic programs using Girard'...
AbstractMany studies [1, 7, 20, 21, 26, 28] have shown the soundness and completeness of SLD-resolut...
AbstractThe coincidence of the declarative and procedural interpretations of logic programs does not...
AbstractThree semantics have been proposed as the most promising candidates for a declarative interp...
The authors present semantics for logic programs using term rewrite systems. Reading program lines f...
AbstractA sound and complete semantics is given for sequential, depth-first logic programming with a...
The goal of this paper is to construct a semantic basis for the abstract interpretation of Prolog pr...
The goal of this paper is to construct a semantic basis for the abstract interpretaion of Prolog pro...
AbstractThis paper proposes to specify semantic definitions for logic programming languages such as ...
This paper proposes to specify semantic definitions for logic programming languages such as Prolog i...
AbstractWe define a semantics for negation as failure in logic programming. Our semantics may be vie...
The paper defines a new declarative semantics for logic programs, which is based on interpretations ...
AbstractIn this paper, we define a framework in which the termination of Prolog programs can be prov...
One of the most important and difficult problems in logic programming is the problem of finding a su...
We extend the abstract interpretation point of view on context-free grammars by Cousot and Cousot to...
AbstractCerrito (1990) has proposed a declarative semantics for allowed logic programs using Girard'...
AbstractMany studies [1, 7, 20, 21, 26, 28] have shown the soundness and completeness of SLD-resolut...