Fitting, M. (1985). A Deterministic Prolog Fixpoint Semantics. Journal of Logic Programming 2, 111-118.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....from the early seventies, it has lasted until 1984 before a denotational semantics for Prolog was presented, viz. JM]a, that gave account to the behavioral aspects of the language. More recently other (denotational) semantics based on several approaches have appeared, e.g. DM]a, Vi]a. See also [Fi], Fr] AB] BW] Our work on the backtracking language B in the previous sections makes yet another semantics easily available: we can interpret the abstract or uniform statements, declarations and states such that: a set of Prolog clauses can be regarded as a declaration, a Prolog goal ....

M. Fitting, "A Deterministic PROLOG Fixpoint Semantics," Journal of Logic Programming 2, pp. 111-118 (1985).

....not 1 operator once we have the cut operator. Hence even negation as finite failure is modeled denotationally. Similarly we can implement some other built in s like if then 2 and if then else 3. Our results can be considered as the natural evolution of a series of previous results. The first is [8], where an attempt to model divergence is developed in a fixpoint framework. A more adequate semantics for modeling divergence is presented in [4] as an abstraction of a more concrete semantics given in terms of resultants. A resultant H : GammaB, where B is a non empty set of goals, is ....

Melvin Fitting. A Deterministic Prolog Fixpoint Semantics. Journal of Logic Programming, 2(2):111-- 118, 1985.

....argued that there is no natural idea of collecting semantics for PROLOG, and the abstract semantics is defined by resorting to a notion of pre consistent postfixpoint. An interesting idea common to [5] and [6] is the use of sequences of substitutions or atoms. The idea is not completely new (see [11]) but it seems that it has never been deeply understood. The above mentioned works note that lifting a sequence based semantics to the powerset of sequences leads to inconsistencies (the fixpoint of the abstract operator is always the empty set) The point, according to us, is that sequences are ....

Melvin Fitting. A deterministic prolog fixpoint semantics. Journal of Logic Programming, 2(2):111--118, 1985.

....first into a computed answer denotational semantics and the second into a call pattern denotational semantics. These two semantics admit a bottom up formulation only. All proofs not contained in this paper can be found in [22] 2 Related works There exist many formalisations for subsets of Prolog [1,3,9,24,10,11,16,17,21], and even a formalisation for full Prolog [2] We must therefore justify why a new semantics for a subset of Prolog (more precisely, Prolog with the cut but without database and set operations) is needed. A common weakness of previous approaches (except [1] and [2] when used for abstract ....

....of a concurrent logic program. Our approach generalises this through the use of observability constraints. Moreover, we show how the cut operator can be easily handled in this context. Our semantics can be considered as the natural evolution of a series of previous proposals. The first is [11], where divergence is modelled in a fixpoint framework. A more adequate semantics for modelling divergence is presented in [3] as an abstraction of a more concrete semantics given in terms of resultants. A resultant H : GammaB, where B is a non empty set of goals, is abstracted into a divergent ....

Melvin Fitting. A Deterministic Prolog Fixpoint Semantics. Journal of Logic Programming, 2(2):111--118, 1985.

No context found.

Fitting, M. (1985). A Deterministic Prolog Fixpoint Semantics. Journal of Logic Programming 2, 111-118.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC