F. Spoto. Operational and goal-independent denotational semantics for Prolog with cut. Journal of Logic Programming, 42(1):1-46, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....is that we obtain a denotation of the program by applying a bottom up immediate consequences operator, which seems to be more appropriate in our context since the main motivation of our work lies in abstracting the semantics to obtain a bottom up partial deduction scheme. Also closely related is [24]. It de nes a goal independent abstract semantics of Prolog that also models the depth rst search rule and the cut. The semantics consists of a sequence of pairs, of which one part denotes a computed answers while the other part the so called observability constraints give information ....

F. Spoto. Operational and goal-independent denotational semantics for Prolog with cut. Journal of Logic Programming, 42(1):1-46, 2000.

.... and Goal Independent Denotational Semantics for Prolog with Cut: Proofs Fausto Spoto Dipartimento di Informatica Universit a di Pisa spoto di.unipi.it Abstract This paper contains the proofs of the results of [1] not already contained there. We refer to [1] for notation. We define a stronger ordering on trees than . We say that T2 is a blooming of T1 , and we write T1 OE T2 , if and only if T2 is obtained with a strict expansion of the divergent leaves of T1 . More formally we define: G; OE (G; if ....

....and Goal Independent Denotational Semantics for Prolog with Cut: Proofs Fausto Spoto Dipartimento di Informatica Universit a di Pisa spoto di.unipi.it Abstract This paper contains the proofs of the results of [1] not already contained there. We refer to [1] for notation. We define a stronger ordering on trees than . We say that T2 is a blooming of T1 , and we write T1 OE T2 , if and only if T2 is obtained with a strict expansion of the divergent leaves of T1 . More formally we define: G; OE (G; if not div(G) G; OE (G; t) if div(G) ....

Fausto Spoto. Operational and Goal-Independent Denotational Semantics for Prolog with Cut. Journal of Logic Programming, ?? To appear.

....Sections 8 and 9 show two abstractions of the semantics of Section 7, the 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 ....

.... The same remark holds for Equations (25) 26) and (32) define the unfolding immediate consequence operator as T T P (I) I T 0 1 P I : 5) Note that I T 0 is strongly P directed and it can be shown that 1 P is closed on the set of strongly P directed interpretations (see [22]) Hence we can define two sequences of strongly P directed interpretations as: I 0 = I T 0 ; I i 1 = I T 0 1 P I i = T T P (I i ) 6) and J 0 = I T 0 ; J i 1 = J i 1 P I T 0 : 7) Definition 19 In the completion of (T; we can define S bu P = lub i I i ; S td P = lub i J i ....

Fausto Spoto. Operational and GoalIndependent Denotational Semantics for Prolog with Cut: Proofs. Available at the web address http://strudel.di.unipi.it/papers/papers.html.

No context found.

F. Spoto. Operational and goal-independent denotational semantics for Prolog with cut. Journal of Logic Programming, 42(1):1-46, 2000.

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