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
AbstractThe formal semantics of a programming language consists of assigning to every program of the...
Most logic programming languages actually provide some kind of dynamic scheduling to increase the ex...
AbstractAbstract interpretation is a theory of semantics approximation that is used for the construc...
AbstractWe present a denotational semantics for a logic program to construct a dataflow for the logi...
A fully abstract denotational semantics for logic programming has not been constructed yet. In this ...
AbstractThis paper is concerned with functionality of a logic program. Functionality based on input-...
AbstractA theory of semantics-based dataflow analysis using a notion of “insertion” is presented. Th...
AbstractThis paper is concerned with functionality of a logic program. Functionality based on input-...
Denotational semantics is presented as a valuable theoretical tool, having many applications includi...
AbstractThis paper establishes a method of constructing a recursion equation set computing a given l...
AbstractIt has been proposed by Meyer, Kfouri and others to extend the so-called Nonstandard Logics ...
AbstractThe formal semantics of a programming language consists of assigning to every program of the...
AbstractThe paper introduces a semantics for definite logic programs expressed in terms of SLD-deriv...
AbstractWe define a semantic framework to reason about properties of abstractions of SLD-derivations...
Call number: LD2668 .T4 CMSC 1988 S86Master of ScienceComputing and Information Science
AbstractThe formal semantics of a programming language consists of assigning to every program of the...
Most logic programming languages actually provide some kind of dynamic scheduling to increase the ex...
AbstractAbstract interpretation is a theory of semantics approximation that is used for the construc...
AbstractWe present a denotational semantics for a logic program to construct a dataflow for the logi...
A fully abstract denotational semantics for logic programming has not been constructed yet. In this ...
AbstractThis paper is concerned with functionality of a logic program. Functionality based on input-...
AbstractA theory of semantics-based dataflow analysis using a notion of “insertion” is presented. Th...
AbstractThis paper is concerned with functionality of a logic program. Functionality based on input-...
Denotational semantics is presented as a valuable theoretical tool, having many applications includi...
AbstractThis paper establishes a method of constructing a recursion equation set computing a given l...
AbstractIt has been proposed by Meyer, Kfouri and others to extend the so-called Nonstandard Logics ...
AbstractThe formal semantics of a programming language consists of assigning to every program of the...
AbstractThe paper introduces a semantics for definite logic programs expressed in terms of SLD-deriv...
AbstractWe define a semantic framework to reason about properties of abstractions of SLD-derivations...
Call number: LD2668 .T4 CMSC 1988 S86Master of ScienceComputing and Information Science
AbstractThe formal semantics of a programming language consists of assigning to every program of the...
Most logic programming languages actually provide some kind of dynamic scheduling to increase the ex...
AbstractAbstract interpretation is a theory of semantics approximation that is used for the construc...
DOI
Add to ORKG