## Institutions for Logic Programming (1997)

Venue: | Theoretical Computer Science |

Citations: | 4 - 1 self |

### BibTeX

@ARTICLE{Orejas97institutionsfor,

author = {Fernando Orejas and Elvira Pino and Hartmut Ehrig},

title = {Institutions for Logic Programming},

journal = {Theoretical Computer Science},

year = {1997},

volume = {173}

}

### OpenURL

### Abstract

The compositionality of the semantics of logic programs with respect to (different varieties of) program union has been studied recently by a number of researchers. The approaches used can be considered quite ad-hoc in the sense that they provide, from scratch, the semantic constructions needed to ensure compositionality and, in some cases, full abstraction in the given framework. In this paper, we study the application of general algebraic methods for obtaining, systematically, this kind of results. In particular, the method proposed consists in studying the adequate institution for describing the given class of logic programs and, then, in using general institutionindependent results to prove compositionality and full abstraction. This is done in detail for the class of definite logic programs with respect to three kinds of composition operations: W-union, standard union and module composition. In addition two different institutions are considered: the standard institution...

### Citations

1855 |
Foundations of Logic Programming
- Lloyd
- 1987
(Show Context)
Citation Context ...algebraic specification and logic programming. In addition, certain familiarity with basic constructs from category theory is required. For more details on some of these topics the reader may consult =-=[1, 3, 8, 21, 27]-=-. A short preliminary version of this paper was presented as an invited lecture in the 19th Int. Conf. on Mathematical Foundations of Computer Science [24]. ACKNOWLEDGEMENTS Some initial work in this ... |

476 |
Institutions: Abstract model theory for specication and programming
- Goguen, Burstall
- 1992
(Show Context)
Citation Context ...tained should be applicable independently of the specific logic used for specification. This kind of work essentially started with the introduction of the notion of institution by Goguen and Burstall =-=[13, 14]-=-. On the other hand, in the area of logic programming, in these years, a number of modular constructions for logic programming have been proposed (see, e.g. [2, 18, 19, 22, 23, 25]). These papers, aft... |

394 | Category Theory for Computing Science - Barr, Wells - 1999 |

224 |
Algebraic Specification
- Wirsing
- 1990
(Show Context)
Citation Context ...algebraic specification and logic programming. In addition, certain familiarity with basic constructs from category theory is required. For more details on some of these topics the reader may consult =-=[1, 3, 8, 21, 27]-=-. A short preliminary version of this paper was presented as an invited lecture in the 19th Int. Conf. on Mathematical Foundations of Computer Science [24]. ACKNOWLEDGEMENTS Some initial work in this ... |

219 |
Fundamentals of Algebraic Specification 1
- Ehrig, Mahr
- 1985
(Show Context)
Citation Context ...algebraic specification and logic programming. In addition, certain familiarity with basic constructs from category theory is required. For more details on some of these topics the reader may consult =-=[1, 3, 8, 21, 27]-=-. A short preliminary version of this paper was presented as an invited lecture in the 19th Int. Conf. on Mathematical Foundations of Computer Science [24]. ACKNOWLEDGEMENTS Some initial work in this ... |

161 |
The semantics of Clear, a specification language
- Burstall, Goguen
- 1980
(Show Context)
Citation Context ...Burstall as a means to describe, at an abstract level, logical systems that can be used for specification or other purposes. The idea was connected with the design of the Clear specification language =-=[4]-=-. In particular, Clear was defined as providing operations for structuring specifications independently of the underlying logic (institution). Technically, an institution is defined in terms of four p... |

129 |
Constructive negation based on the completed database
- Chan
- 1988
(Show Context)
Citation Context ...ch are, in a sense, monotonic. Nevertheless, we think that this problem can be solved by handling negative literals as constraints. This seems to be equivalent to some forms of constructive negation (=-=[5, 26]-=-). The second problem is of more technical nature and refers to proving that such an institution satisfies the structural properties of theorems 3.1.3 and 3.2.3. In particular, we may doubt about the ... |

127 |
Introducing institutions
- Goguen, Burstall
- 1983
(Show Context)
Citation Context ...tained should be applicable independently of the specific logic used for specification. This kind of work essentially started with the introduction of the notion of institution by Goguen and Burstall =-=[13, 14]-=-. On the other hand, in the area of logic programming, in these years, a number of modular constructions for logic programming have been proposed (see, e.g. [2, 18, 19, 22, 23, 25]). These papers, aft... |

120 | Negation and constraint logic programming
- Stuckey
- 1995
(Show Context)
Citation Context ...T project COSMOS (ref. TIC95-1016-C02-01). 2. Basic algebraic concepts In this section we briefly review some basic notions on algebraic specification needed in the paper (for further detail see e.g. =-=[8,26]-=- and also [13,14] and [7] for more detail on institutions and specification frames). Institutions were invented by Goguen and Burstall as a means to describe, at an abstract level, logical systems tha... |

69 | A Compositional Semantics for Logic Programs - Bossi, Gabbrielli, et al. - 1994 |

57 |
E.: Fully Abstract Compositional Semantics for Logic Programs
- Gaifman, Shapiro
- 1989
(Show Context)
Citation Context ...institution by Goguen and Burstall [13, 14]. On the other hand, in the area of logic programming, in these years, a number of modular constructions for logic programming have been proposed (see, e.g. =-=[2, 18, 19, 22, 23, 25]-=-). These papers, after providing some semantic definition for their proposals, often study different kinds of properties associated to the given definition. One such property is compositionality of th... |

38 |
B.: Fundamentals of Algebraic Specification 2
- Ehrig, Mahr
- 1990
(Show Context)
Citation Context ...urn, may be imported by M2 to define the predicates imported by M1. In particular, whether it is possible to have compositionality for this kind of recursive composition of modules is an open problem =-=[9]-=-. As a consequence, one may consider that this is a case of weakness of this kind of general methods since, in [18], Gaifman and Shapiro were, at least, able to prove full abstraction. Actually, we do... |

35 |
A calculus for the construction of modular Prolog programs
- Sannella, Wallen
- 1992
(Show Context)
Citation Context ...institution by Goguen and Burstall [13, 14]. On the other hand, in the area of logic programming, in these years, a number of modular constructions for logic programming have been proposed (see, e.g. =-=[2, 18, 19, 22, 23, 25]-=-). These papers, after providing some semantic definition for their proposals, often study different kinds of properties associated to the given definition. One such property is compositionality of th... |

31 |
Declarative modeling of the operational behaviour of logic languages
- Falaschi, Levi, et al.
- 1989
(Show Context)
Citation Context ...odel, and a new one that better captures the input/output operational behaviour of logic programs. In particular, in that framework the semantics of a program coincides with the so-called s-semantics =-=[12]-=-. However, it must be said that the results are, actually, quite more general. They are not restricted to the class of definite logic programs, but they apply to any class of logic programs provided t... |

24 |
Contribations to the semantics of open logics programs, in
- Bossi, Gabrielli, et al.
- 1992
(Show Context)
Citation Context ...institution by Goguen and Burstall [13, 14]. On the other hand, in the area of logic programming, in these years, a number of modular constructions for logic programming have been proposed (see, e.g. =-=[2, 18, 19, 22, 23, 25]-=-). These papers, after providing some semantic definition for their proposals, often study different kinds of properties associated to the given definition. One such property is compositionality of th... |

21 |
A Logical Analysis of Modules
- Miller
- 1989
(Show Context)
Citation Context |

15 | Observationally Equivalences for Logic Programs
- Gabbrielli, Levi, et al.
- 1992
(Show Context)
Citation Context ...by definition of free construction, Sem(M1)(A) = TMWM1 = TMWM2 = Sem(M2)(A), where M is the W-open program (W,A). " This theorem may be seen as an abstract and more general formulation of a resul=-=t in [16]-=-. In particular, in that paper it is shown that, if we consider as the semantics of an open program (W, P) the function (G P +id) w , where GP denotes the immediate consequence operator associated to ... |

12 |
Orejas, New concepts for amalgamation and extension in the framework of specification logics
- Baldamus, F
- 1993
(Show Context)
Citation Context ...-1016-C02-01). 2. Basic algebraic concepts In this section we briefly review some basic notions on algebraic specification needed in the paper (for further detail see e.g. [8,26] and also [13,14] and =-=[7]-=- for more detail on institutions and specification frames). Institutions were invented by Goguen and Burstall as a means to describe, at an abstract level, logical systems that can be used for specifi... |

11 |
Theory of algebraic module specification including behavioral semantics and constraints
- Ehrig, Baldamus, et al.
- 1992
(Show Context)
Citation Context ...ions and specification frames where some symbols are interpreted over a predefined structure (initial constraints , in algebraic terminology) has already been studied by a number of authors (see, e.g.=-=[6, 14]-=-). Actually, the connection between CLP and initial constraints was already exploited in [17]. 5.1.1 Definition Let SF = (Spec L , Mod: Spec LsCat op ) be a specification frame and let E be a predefin... |

9 |
On recent trends in algebraic specification
- Ehrig, Pepper, et al.
- 1989
(Show Context)
Citation Context ...d every f: A1sA2 in Mod(S',Ax') into V h (f). In both cases, the satisfaction condition ensures that V h (A) and V h (f) are in Mod(S,Ax). form an indexed category which we call a specification frame =-=[10,11]-=-. Specification frames allow us to deal with institutions at a slightly higher abstraction level. In particular, they are useful when the notions of formula or formula satisfaction are not needed to o... |

9 | Proof theory and semantics of logic programs - Gaifman, Shapiro - 1989 |

6 |
Abstract and behaviour module specifications
- Ehrig, Orejas, et al.
- 1993
(Show Context)
Citation Context ...d every f: A1sA2 in Mod(S',Ax') into V h (f). In both cases, the satisfaction condition ensures that V h (A) and V h (f) are in Mod(S,Ax). form an indexed category which we call a specification frame =-=[10,11]-=-. Specification frames allow us to deal with institutions at a slightly higher abstraction level. In particular, they are useful when the notions of formula or formula satisfaction are not needed to o... |

2 | Algebraic Methods in the Compositional Analysis of Logic Programs (Invited paper
- Orejas, Pino, et al.
- 1999
(Show Context)
Citation Context ...e topics the reader may consult [1, 3, 8, 21, 27]. A short preliminary version of this paper was presented as an invited lecture in the 19th Int. Conf. on Mathematical Foundations of Computer Science =-=[24]-=-. ACKNOWLEDGEMENTS Some initial work in this subject was done together with Andrea Corradini during a visit of the first author to Berlin. This work has been partially supported by ESPRIT Basic Resear... |

1 |
Models and Equality for Logical
- Goguen, Meseguer
- 1987
(Show Context)
Citation Context ...itial constraints , in algebraic terminology) has already been studied by a number of authors (see, e.g.[6, 14]). Actually, the connection between CLP and initial constraints was already exploited in =-=[17]-=-. 5.1.1 Definition Let SF = (Spec L , Mod: Spec LsCat op ) be a specification frame and let E be a predefined structure constraining SF in the sense that E is equipped with a functor ModE : Spec LsCat... |

1 |
A.Porto, A Language for Contextual Logic
- Monteiro
- 1993
(Show Context)
Citation Context |