| M. Gabbrielli, G. Levi, and M. C. Meo. Observable Behaviours and Equivalences of Logic Programs. Submitted for publication. |
....n T n. 4 Semantics for partial answers and call patterns In this section we show how from suitable abstractions of the resultant semantics we can obtain a fully abstract semantics for partial and computed answers, and a correct semantics for call patterns. These semantics extend those in [15] to consider also the selection rule. Informally, a partial answer for a query G in the program P is the substitution (restricted to the variables in G) computed by any finite, possibly non terminated, SLD derivation. A call pattern instead is any selected atom in an SLD derivation. The knowledge ....
....in the mentioned papers) Moreover, it is worth noting that while clauses were used in [7] to obtain a semantics compositional wrt the union of programs, here our aim was to model resultants and other observables such as call patterns and partial answers. These observables were considered also in [15] without taking into account the selection rule. Also related are the works [3, 4] which, using a more complex semantic domain, aim at a semantics modeling the Prolog deep first search strategy. More recently, the paper [9] constructs an algebraic framework which, starting from a semantics similar ....
M. Gabbrielli, G. Levi, and M. C. Meo. Observable Behaviours and Equivalences of Logic Programs. Submitted for publication.
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