M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, volume 510 of Lecture Notes in Computer Science, pages 1--19. Springer-Verlag, Berlin, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of programs, which is based on our ability to detect when two programs can not be distinguished observing their behaviors. It is well known the inadequacy of the previously mentioned approaches to study the observational equivalence of classical logic programs [2] In that sense the s semantics [3, 5], extending the Herbrand interpretation, really captures the operational semantics, and is therefore suitable for semantic based logic analysis and to reason in terms of program equivalences. Unfortunately this approach can not be used in fohh programs, because the introduction of implication in ....

M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, volume 510 of Lecture Notes in Computer Science, pages 1--19. Springer-Verlag, 1991.

.... [38, 40] Compositionality has to do with a (syntactic) composition operator , and holds when the meaning (semantics) of a compound construct is defined by composing the meanings of the constituents ( and ( i.e. for a suitable function , In the case of logic programs [13], the properties of two most important operators have been widely investigated, namely AND composition (of atoms in a goal or in a clause body) and OR composition, i.e. composition of (sets of) clauses. In the context of equational logic programming [20, 24] compositionality of the semantics has ....

....analysis for the problem of unsatisfiability. Then we show that compositionality leads, as a by product, to an incremental implementation for the analysis. Therefore, while OR compositionality, i.e. compositionality w.r.t. union of programs, has proven significant for programming with modules [4, 13], we show that AND compositionality can lead to incremental computations. This paper is organized as follows. After introducing some preliminary notions in Section 2, Section 3 defines an operator which describes the operational semantics of equational Horn programs in a compositional way. In ....

M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez Artalejo, editors, , volume 510 of , pages 1--19. Springer-Verlag, Berlin, 1991.

....C C f C C 1 2 1 1 2 1 2 1 2 1 2 1 Introduction Abstract. Keywords: Compositional Analysis for Equational Horn Programs Mar ia Alpuente , Moreno Falaschi and Germ an Vidal Compositionality is a desirable property which has been recognised as fundamental in the semantics of programming languages [11]. Compositionality has to do with a (syntactic) composition operator , and holds when the meaning (semantics) of a compound construct is defined by composing the meanings of the constituents ( and ( i.e. for a suitable function , In the case of logic programs [11] one ....

.... [11] Compositionality has to do with a (syntactic) composition operator , and holds when the meaning (semantics) of a compound construct is defined by composing the meanings of the constituents ( and ( i.e. for a suitable function , In the case of logic programs [11], one could be concerned with AND composition (of atoms in a goal or in a clause body) or with OR composition, i.e. composition of (sets of) clauses. In the context of equational logic programming [15,19] consideration has been given to the problem of defining a compositional semantics for the ....

[Article contains additional citation context not shown here]

M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez Artalejo, editors, , volume 510 of , pages 1--19. Springer-Verlag, Berlin, 1991.

....In fact we show that any isa hierarchy can be transformed by means of into a single flat program, whose SLD semantics is equivalent to the extended SLD semantics of the isa hierarchy. We then introduce a declarative semantics for differential programs following the approach described in [13]. In that paper, the idea is that a declarative characterization of the programs operational behaviour can be obtained by accommodating in the programs interpretations more complex syntactic objects. The notion of observable which the semantics of [13] is meant to capture is given by the ....

....programs following the approach described in [13] In that paper, the idea is that a declarative characterization of the programs operational behaviour can be obtained by accommodating in the programs interpretations more complex syntactic objects. The notion of observable which the semantics of [13] is meant to capture is given by the computed answer substitutions (cas in the following) of a program. Here, we generalize the notion of interpretations based on clauses which was adopted in [3] to obtain a (cas; OR) congruent semantics and we introduce the notion of context sensitive ....

M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, volume 510 of LNCS, pages 1--19. Springer-Verlag, 1991.

....been introduced in [5] to characterize logic programs structured by inheritance mechanisms. Moreover compositionality is the base to develop semantics based tools for the modular analysis and transformation of programs. Over the last few years we have developed a general approach to the semantics [21, 7], whose 2 aim was modeling the observable behaviors (possibly in a compositional way) for a variety of logic languages, ranging from positive logic programs [17, 9, 8] to constraint logic programs [20, 19] and general logic programs [35] Our approach is based on the idea of choosing ....

....then defined (using a different semantic domain) a fully abstract OR compositional semantics modeling computed answers [24] The Omega Gammae 394 tics [9, 8, 8] is the real compositional generalization of the s semantics and uses non unit clauses as domain. In this paper, following the approach of [21], we first define a semantics scheme which generalizes the Omega Gammae 125 tics and provides a uniform framework for defining different compositional semantics for logic programs parametrically wrt a given notion of observability. The scheme allows both top down (operational) and bottom up ....

[Article contains additional citation context not shown here]

M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, volume 510 of Lecture Notes in Computer Science, pages 1--19. Springer-Verlag, Berlin, 1991.

....have an equivalent algebraic semantics [29] directly defined on the algebraic structure of X . In this paper we formalize a framework for defining various semantics, each corresponding to a specific observable property of computations, thus applying to the CLP case the methodology proposed in [22, 6]. Each semantics can be equivalently defined either operationally (top down) or declaratively (bottom up) as the least fixpoint of a suitable operator. The construction is based on a new notion of interpretation, on a natural extension of the standard notion of truth and on the definition of ....

M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, volume 510 of Lecture Notes in Computer Science, pages 1--19. Springer-Verlag, Berlin, 1991.

....R D, A) f (g; c) j hg; c 2 ; ksi 2 A g: It is easy to see that p 1 = p 2 iff for any goal g, g has the same answer constraints in p 1 and in p 2 . 2.2 Semantic properties of SLD trees The goal we want to achieve is to develop a denotation modeling SLD trees. We follow the approach in [14, 2], by first defining a syntactic semantic domain ( interpretation) Our modeling of SLD trees is essentially the basic denotation defined in terms of clauses in [11, 15] extended to handle constraint systems in the style of [17, 19, 20] In the following for the sake of simplicity we consider ....

M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, volume 510 of Lecture Notes in Computer Science, pages 1--19. Springer-Verlag, Berlin, 1991.

....program is obtained by combining the semantics of its components. The approach is based on the notion of differential programs, logic programs annotated in order to make their external interfaces explicit. The semantic characterization is defined following the general approach described in [11]. In that paper, the idea is to accommodate in the programs interpretations more syntactic objects in order to achieve an accurate declarative characterization of the programs operational behaviour. Along the same guidelines, here we introduce the notion of context sensitive interpretations ....

M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, volume 510 of Lecture Notes in Computer Science, pages 1--19. SpringerVerlag, Berlin, 1991.

....of terms respectively, while B will denote a (possibly empty) conjunction of atoms. For any set A, A denotes the set of finite sequences of elements of A. will denote concatenation of sequences and is the empty sequence. 2 The s semantics approach The aim of the s semantics approach [82, 56, 52, 58] is modeling the observable behaviors (possibly in a compositional way) for a variety of logic languages. The approach is based on the idea of choosing (equivalence classes of) sets of clauses as semantic domains. The denotations are then defined by syntactic objects, as in the case of Herbrand ....

M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, volume 510 of Lecture Notes in Computer Science, pages 1--19. SpringerVerlag, Berlin, 1991.

....are described in [19, 5, 4] Clearly, OR compositionality is a desirable property both for theoretical (compositional semantics of modules) and for practical (modular program analysis and transformation) purposes. Over the last few years we have developed a general approach to the semantics [13], whose aim was modeling the observable behaviors (possibly in a compositional way) for a variety of logic languages, ranging from positive logic programs [10, 11, 5, 4] to general logic programs [26, 16] constraint logic programs [12] and concurrent constraint programs [14] Our approach is ....

....then defined (using a different semantic domain) a fully abstract OR compositional semantics modeling computed answers [19] The Omega Gammae 301 tics [5, 4] is the real compositional generalization of the s semantics and uses non unit clauses as domain. In this paper, following the approach of [13], we first define a semantic scheme which generalize Omega Gammaenera tics and provides a uniform framework for defining different compositional semantics for logic programs parametrically wrt a given notion of observable. The scheme allows both top down (operational) and bottom up (fixpoint) ....

M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez-Artalejo, editors, 18th Int'l Colloquium on Automata, Languages an Programming, volume 510 of Lecture Notes in Computer Science, pages 1--19. Springer-Verlag, Berlin, 1991.

.... BOSSI, MAURIZIO GABBRIELLI, GIORGIO LEVI, MARIA CHIARA MEO In this chapter we show a semantics for pure logic programs which correctly models computed answer substitutions and which is compositional wrt union of programs (i.e. OR compositional) According to the general approach described in [15], the semantics is based on a domain which consists of sets of (equivalence classes of) clauses. We first define an operational version O Omega (P ) of the semantics and we prove its compositionality. Then we show a fixpoint semantics F Omega (P ) originally introduced in [5] and we prove ....

....predicates are considered partially defined. When we consider an open program we are always assuming a previously given set Omega Gamma We will introduce a semantics of Omega Gamma 2 en programs which is compositional w.r.t. Omega . To define the semantics we follow the general approach in [15] which leads to semantics definitions which characterize the program operational behavior by using extended interpretations ( denotations) which are more expressive than Herbrand interpretations. The improved expressive power is obtained by accomodating more syntactic objects in denotations, ....

[Article contains additional citation context not shown here]

M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, volume 510 of Lecture Notes in Computer Science, pages 1--19. Springer-Verlag, Berlin, 1991.

No context found.

M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, volume 510 of Lecture Notes in Computer Science, pages 1--19. Springer-Verlag, Berlin, 1991.

No context found.

M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, volume 510 of Lecture Notes in Computer Science, pages 1--19. Springer-Verlag, Berlin, 1991.

No context found.

M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert and B. Monien and M. Rodriguez-Artalejo, editors, Proc. of the 18th International Colloquium on Automata, Languages and Programming, volume 510 of Lecture Notes in Computer Science, pages 1--19. Springer-Verlag, Berlin, 1991.

No context found.

M. Gabbrielli, G. Levi. On the semantics of Logic Programs. Proc. ICALP'91, J. Leach, B. Monien, M. Rodriguez-Artalejo (eds.), Springer LNCS 510 (1991) 1-19.

No context found.

#M. Gabbrielli, G. Levi, On the semantics of Logic Programs, in Proc. ICALP 91, J. Leach, B. Monien, M. Rodriguez-Artalejo (eds.), Springer LNCS 510 (1991) 1-19.

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