M. Comini, G. Levi, and M. C. Meo. A theory of observables for logic programs. Information and Computation, 169, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Indexed Categories and Bottom-Up Semantics of Logic Programs - Amato, Lipton (2001) (Correct)
....to evaluate the new features, or to formalize the very notion of declarative programming. Moreover, semantic methods for Horn logic programming are increasingly similar in spirit to those for functional and imperative programming, under the stimulus of techniques such as abstract interpretation [12, 8]. This suggests looking for a suciently exible new logic programming foundation using a framework in which all these paradigms can be well understood. Categorical logic seems an excellent candidate for such an undertaking. Categorical approaches to logic programming go back to the treatment of ....
.... of logic programming, since it appears, in one form or another, across several semantic treatments of logic programs [4] Most of the studies in the semantics of logic programming are heavily based on the existence of some xpoint construction: treatments of compositionality of semantics [8], modularity [6] static analysis [12] and debugging [9] For this reason, it seems to us that further investigation of a categorical framework which includes a form of bottom up semantics is advisable. The rst step in this direction was taken in [13] which uses categorical syntax over nite ....
M. Comini, G. Levi, and M. C. Meo. A Theory of Observables for Logic Programs. Information and Computation, 169:23-80, 2001.
A Reconstruction of Verification Techniques by Abstract.. - Levi, al. (1997) (1 citation) (Correct)
.... greatest well formed subset of S and S= fd j first(d) G; last(d) hA; Bi; A2 1 (X(G) 2 (ff(d) 2 (X(G) g The pair (ff; fl) gives a Galois connection between (C ; v) and (S; It is easy to prove that this abstraction verifies the properties of denotational observables, as defined in [CLM96]. This means above all that the abstraction is precise on the semantic operator associated to program and that we can define an abstract semantics for programs that preserve many properties of the concrete one. We obtain the optimal abstract semantic function on S associated to clauses by standard ....
M. Comini, G. Levi, and M. C. Meo. A theory of observables for logic programs. Submitted for publication, 1996.
Compositionality Properties of SLD-derivations - Comini, Meo (1996) (7 citations) Self-citation (Comini Meo) (Correct)
....semantics and the transition system are defined in terms of a set of primitive semantic operators, whose properties are directly related to the properties of the denotation. The SLD derivations semantics has been designed to act as collecting semantics for a framework of abstract semantics [3,4]. Key words: logic programming, SLD derivations, semantics, compositionality. 1 Introduction Lack of compositionality of conventional logic programming semantics has been a serious limitation, since by they very nature PROLOG program fragments are written to be used in an extensible, modular ....
....abstraction is essentially abstraction of the primitive semantic operators, the abstract semantics will inherit all those properties of the collecting semantics for which the suitable lemmata on the semantic operators hold. This provides the basis for the definition of a taxonomy of abstractions [3,4]. It is worth noting that the SLD derivations semantics is the most natural choice for a collecting semantics. It is essentially a traces semantics and it contains all the relevant information of SLD trees. A more abstract semantics, such as the resultant semantics, would not allow to derive ....
[Article contains additional citation context not shown here]
M. Comini, G. Levi, and M. C. Meo. A theory of observables for logic programs. Submitted for publication, 1996.
Properties of the Lattice of Observables in Logic Programming - Amato, Levi (1997) (2 citations) Self-citation (Levi) (Correct)
....enjoy desired precision properties. keywords: logic programming, semantics, compositionality, abstract interpretation, abstract semantics. 1 Introduction Our goal is showing several useful properties enjoyed by the lattice of abstractions introduced in [3] and subsequently developed in [17] [4] and [5] In these papers, an operational top down and a denotational bottom up semantics for positive logic programs are defined, both of them expressed in terms of SLD derivations, and several properties of compositionality, correctness, minimality, and equivalence are stated. Then, abstract ....
....programming setting. 3 A semantic framework for logic programs In order to discuss abstraction in logic programming we need to choose a concrete domain and the related operational and denotational semantics. In this paper we will use the semantic framework introduced in [3] and developed in [4] and [5] Here we recall only the main definitions and results. 3.1 Basic framework In this framework we are able to reason about compositional properties of SLD derivations and their abstractions (observables) in the case of definite logic programs. An operational and a denotational semantics ....
M. Comini, G. Levi, and M. C. Meo. A theory of observables for logic programs. Submitted for publication, 1996.
Optimality in Goal-dependent Analysis of Sharing - Amato, Scozzari (2002) (Correct)
No context found.
M. Comini, G. Levi, and M. C. Meo. A theory of observables for logic programs. Information and Computation, 169, 2001.
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