A. Brogi, E. Lamma, P. Mello, Open Logic Theories, Proceedings of the II Workshop on Extensions of Logic Programming (WELP91), Kista, Sweden, 1991, also in H.H.Erikkson, P.Krueger and P.Schroeder-Heister (eds.), Lecture Notes in Artificial Intelligence No. 596 Springer-Verlag, Berlin. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Open Logic Theory Composition In A Software Engineering.. - Denti, Omicini (1994) (Correct)
....the idea that a program is an incomplete description of some knowledge domain [6] and that new behaviours (and, at the end, new systems) can be obtained by properly dynamically extending an existing program chunk. From this perspective, logic theories should be conceived as open logic theories [8]. In this work, we will try to explore the impact of (both static and dinamic) open logic theory composition over the main points of interest for a software engineer. The advantages that this approach may have with respect to traditional advanced approaches (such as modern object oriented ....
A. Brogi, E. Lamma, P. Mello, Open Logic Theories, Proceedings of the II Workshop on Extensions of Logic Programming (WELP91), Kista, Sweden, 1991, also in H.H.Erikkson, P.Krueger and P.Schroeder-Heister (eds.), Lecture Notes in Artificial Intelligence No. 596 Springer-Verlag, Berlin.
Compositionality of Normal Open Logic Programs - Verbaeten, Denecker, De Schreye (1997) (4 citations) (Correct)
....on atoms defined in Q (the program Q is in fact a conservative extension of the program P ) By allowing predicates to be open in a logic program, we deal with incomplete knowledge on predicates. In [12] import predicates are introduced to represent this kind of incomplete knowledge. In [7] [6] they work with a different notion of open predicates to capture the possible composition with other programs. Their semantics of admissable Herbrand models for definite programs is suited for compositionality problems, but seems less suitable for knowledge representation. In [5] this semantics is ....
A. Brogi, E. Lamma, and P. Mello. Open Logic Theories. In L.-H. Eriksson, L. Hallnas, and P. Schroeder-Heister, editors, Proc. of the Second International Workshop on Extensions of Logic Programming, pages 73--88. Springer-Verlag, 1991.
An OR-Compositional Semantics for Logic Programs - Bossi, GABBRIELLI, LEVI, MEO (1993) (2 citations) (Correct)
....substitutions, while the denotation defined by the fully abstract semantics in [20] is not a set of clauses (i.e. a program) Our construction, which models also computed answers, is then more useful than those in [19, 20] as a formal basis for modular program analysis. Another related paper is [6], where Omega Gammaer en logic programs are called open theories. Open theories are provided with a model theoretic semantics which is based on ideas very similar to those underlying our model theory. 6] however does not consider semantic definitions in the style of our O Omega (P ) which gives ....
....those in [19, 20] as a formal basis for modular program analysis. Another related paper is [6] where Omega Gammaer en logic programs are called open theories. Open theories are provided with a model theoretic semantics which is based on ideas very similar to those underlying our model theory. [6] however does not consider semantic definitions in the style of our O Omega (P ) which gives a unique denotation to any open program. A different approach to compositionality is pursued in [28, 27] where the semantics of a program P is the (ground) TP operator. This approach could be extended to ....
A. Brogi, E. Lamma, and P. Mello. Open Logic Theories. In P. Krueger L.-H. Eriksson and P. Shroeder-Heister, editors, Proc. of the Second Workshop on Extensions to Logic Programming, Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, 1991.
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