This paper proposes to specify semantic definitions for Prolog in terms of an oracle which provides information on which clauses are to be applied to resolve a given goal. The approach is quite general. It is applicable to pure Prolog to define both operational and declarative semantics, and can be viewed as a basis for both sequential and parallel implementations. Previous semantic definitions for Prolog typically attempt to encode the sequential depth-first search of the language into various mathematical frameworks. A clause is applied in such semantics only if it is chosen under the search strategy. We prefer instead to specify in a more declarative way the condition upon which a clause is to be applied. The decision whether or not...
AbstractMany studies [1, 7, 20, 21, 26, 28] have shown the soundness and completeness of SLD-resolut...
Many abstract interpretation frameworks and analyses for Prolog have been proposed, which seek to ex...
AbstractThe coincidence of the declarative and procedural interpretations of logic programs does not...
This paper proposes to specify semantic definitions for Prolog in terms of an oracle which provides ...
AbstractThis paper proposes to specify semantic definitions for logic programming languages such as ...
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...
The authors present semantics for logic programs using term rewrite systems. Reading program lines f...
The coincidence of the declarative and procedural interpretations of logic programs does not apply t...
AbstractThe semantics of PROLOG programs is usually given in terms of the model theory of first-orde...
B.Rovan, Ed. See IBM Germany IWBS Report 115, April 1990. Reprinted in: E.Boerger, K.Daessle...
The semantics of Prolog programs is usually given in terms of model theoretic semantics. However, th...
AbstractIn this paper we investigate how to use logic programming (in particular, Prolog) as query l...
Abstract interpretation is a general methodology for systematic develop-ment of program analyses. An...
The logic programming language Prolog has been shown to be a very suitable language for implementing...
AbstractMany studies [1, 7, 20, 21, 26, 28] have shown the soundness and completeness of SLD-resolut...
Many abstract interpretation frameworks and analyses for Prolog have been proposed, which seek to ex...
AbstractThe coincidence of the declarative and procedural interpretations of logic programs does not...
This paper proposes to specify semantic definitions for Prolog in terms of an oracle which provides ...
AbstractThis paper proposes to specify semantic definitions for logic programming languages such as ...
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...
The authors present semantics for logic programs using term rewrite systems. Reading program lines f...
The coincidence of the declarative and procedural interpretations of logic programs does not apply t...
AbstractThe semantics of PROLOG programs is usually given in terms of the model theory of first-orde...
B.Rovan, Ed. See IBM Germany IWBS Report 115, April 1990. Reprinted in: E.Boerger, K.Daessle...
The semantics of Prolog programs is usually given in terms of model theoretic semantics. However, th...
AbstractIn this paper we investigate how to use logic programming (in particular, Prolog) as query l...
Abstract interpretation is a general methodology for systematic develop-ment of program analyses. An...
The logic programming language Prolog has been shown to be a very suitable language for implementing...
AbstractMany studies [1, 7, 20, 21, 26, 28] have shown the soundness and completeness of SLD-resolut...
Many abstract interpretation frameworks and analyses for Prolog have been proposed, which seek to ex...
AbstractThe coincidence of the declarative and procedural interpretations of logic programs does not...