AbstractWe present a denotational semantics for a logic program to construct a dataflow for the logic program. The dataflow is defined as an algebraic manipulator of idempotent substitutions and it virtually reflects the resolution deductions
We introduce a practical method for abductive analysis of modular logic programs. This is obtained ...
The main objective of this paper is to present a model of computation which permits logic programs t...
© 1988, Springer-Verlag. An implementation scheme for a logic programming language on the Manchester...
AbstractWe present a denotational semantics for a logic program to construct a dataflow for the logi...
AbstractThis paper is concerned with functionality of a logic program. Functionality based on input-...
A fully abstract denotational semantics for logic programming has not been constructed yet. In this ...
Contains fulltext : 84493_aut.pdf (author's version ) (Open Access) ...
This paper shows how logic programs can be used to implement the transition functions of denotationa...
AbstractA theory of semantics-based dataflow analysis using a notion of “insertion” is presented. Th...
We introduce a practical method for abductive analysis of modular logic programs. This is obtained b...
Most logic programming languages actually provide some kind of dynamic scheduling to increase the ex...
This paper introduces an alternative operational model for constraint logic programs. First, a trans...
AbstractIn dataflow analysis of logic programs, information must be propagated according to the cont...
AbstractThe paper introduces a semantics for definite logic programs expressed in terms of SLD-deriv...
The paper introduces a semantics for definite logic programs expressed in terms of SLD-derivations a...
We introduce a practical method for abductive analysis of modular logic programs. This is obtained ...
The main objective of this paper is to present a model of computation which permits logic programs t...
© 1988, Springer-Verlag. An implementation scheme for a logic programming language on the Manchester...
AbstractWe present a denotational semantics for a logic program to construct a dataflow for the logi...
AbstractThis paper is concerned with functionality of a logic program. Functionality based on input-...
A fully abstract denotational semantics for logic programming has not been constructed yet. In this ...
Contains fulltext : 84493_aut.pdf (author's version ) (Open Access) ...
This paper shows how logic programs can be used to implement the transition functions of denotationa...
AbstractA theory of semantics-based dataflow analysis using a notion of “insertion” is presented. Th...
We introduce a practical method for abductive analysis of modular logic programs. This is obtained b...
Most logic programming languages actually provide some kind of dynamic scheduling to increase the ex...
This paper introduces an alternative operational model for constraint logic programs. First, a trans...
AbstractIn dataflow analysis of logic programs, information must be propagated according to the cont...
AbstractThe paper introduces a semantics for definite logic programs expressed in terms of SLD-deriv...
The paper introduces a semantics for definite logic programs expressed in terms of SLD-derivations a...
We introduce a practical method for abductive analysis of modular logic programs. This is obtained ...
The main objective of this paper is to present a model of computation which permits logic programs t...
© 1988, Springer-Verlag. An implementation scheme for a logic programming language on the Manchester...
DOI
Add to ORKG