H, Gallaire, `Merging objects and Logic programming: relational semantics.' Proceedings of the 5th National Conference on Artificial Intelligence (AAAi-86). Philadelphia (PA). August 1986, Morgan Kaufmann Publishers. Los Altos (CA). 1986. pp. 754--758.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of SILO, as in most object based systems. Most of the systems that combine logic and objects are extensions of the logic programming paradigm, that is they give pre eminence to logic and consider the combination from the programming point of view rather than that of knowledge representation (e.g. [7, 8, 14, 17]) Typically, these systems amount to implementing an object oriented programming language in a logic programming language, just as many of the (early) Integrated Artificial Intelligence Programming Environments, such as LOOPS [2] and KEE [6] included an object oriented programming language ....

....is supported. However, it only deals with atomic inheritance. Although, default reasoning can be achieved, exception of axioms cannot be implemented. 36 The second category includes systems that, like SILO, create a hierarchical structure and usually distinguish between classes and instances. POL [8] realises different inheritance rules by using explicit declarations for different types of methods, such as normal, default and deterministic methods. Multiple inheritance is also supported, but certain specialisation types like knowledge refinement cannot be implemented. SPOOL [7] has a ....

H. Gallaire, Merging objects and logic programming: relational semantics, Proc. of the AAAI'86 (1986) 754-758.

....unification algorithm remains unchanged and efficiency is not significantly improved. Also, their objects lack the structure of SILO objects. Furthermore, most of them face the problem from the programming point of view rather than that of knowledge representation. e.g. systems like [31] POL [32], SPOOL [18] and LAP [33] employ a standard class based hierarchy model, which is not flexible enough for knowledge representation. Systems like MULTILOG [34] 19] and Plog [35] organise logical expressions in sets (objects) that communicate with each other via message passing in a way similar to ....

H. Gallaire, Merging Objects and Logic Programming: Relational Semantics, Proceedings of the AAAI'86, (1986) 754-758.

.... Among the efforts which have been focusing on the dynamic aspects of object oriented programming (i.e. change of state) we have mentioned [11, 17, 19, 29, 30, 31, 32] efforts which have been focusing on the static aspects (i.e. inheritance) of object oriented programming are described in [2, 9, 12, 16, 21, 33]. The framework presented here should provide a theoretical basis for the integration of these two traditions. 10, 28, 8] provide also extensions of Prolog in the direction of object oriented and distributed programming where formulae with multiple heads are allowed; some of the ideas ....

H. Gallaire. Merging objects and logic programming: Relational semantics. In Proc. of AAAI'86, Philadelphia, Pa, U.S.A., 1986.

.... Among the efforts which have been focusing on the dynamic aspects of object oriented programming (i.e. change of state) we have mentioned [6, 12, 14, 22, 23, 24, 25] efforts which have been focusing on the static aspects (i.e. inheritance) of object oriented programming are described in [1, 4, 7, 11, 26]. The framework presented here should provide a theoretical basis for the integration of these two traditions. 5] provides also an extension of Prolog in the direction of object oriented programming where clauses with multiple heads are allowed; some of the ideas characterizing this approach are ....

H. Gallaire. Merging objects and logic programming: Relational semantics. In Proc. of AAAI'86, Philadelphia, Pa, U.S.A., 1986.

....has been used and appreciated most widely. Overriding has been a difficult issue to address in logic, as it is related to negation, belief or theory revision, and non monotonic reasoning. Several approaches were appealing in modeling overriding in knowledge representation and in knowledge bases [9, 38, 11, 4, 26, 8, 35, 6, 22, 5, 31, 5, 2, 3, 29, 28, 39, 13, 14, 30, 19]. Most solutions were computationally expensive, or were heavily dependent on the user for capturing the intended semantics i.e, inheritance was almost hand coded into the program. In the latter case, logic did very little in capturing the spirit of overriding and thus, was error prone. ....

H. Gallaire. Merging object and logic programming: Relational semantics. In AAAI-86, pages 754--758, Philadelphia, PA, 1986.

....invocation fails, then no definitions from superclasses will be searched for or tried. In mergers with logic, it seems equally reasonable to allow further pursuing until either success will be achieved, or the space of appropriate definitions will be used up. Such inheritance is called cumulative. [Gal86] terms these modes of inheritance as call return and success failure, respectively. Most mergers use overriding inheritance. In Prolog KR [Nak84] ESP, and POL [Gal86] cumulation is the default. Overriding is facilitated through special language constructs (the simplest of them cut is ....

....either success will be achieved, or the space of appropriate definitions will be used up. Such inheritance is called cumulative. Gal86] terms these modes of inheritance as call return and success failure, respectively. Most mergers use overriding inheritance. In Prolog KR [Nak84] ESP, and POL [Gal86], cumulation is the default. Overriding is facilitated through special language constructs (the simplest of them cut is readily available in Prolog) In CPU [MN87] the user has to metaprogram the inheritance semantics. Our proposal, MU, falls under the third group of the above ....

H. Gallaire. Merging objects and logic programming: Relational semantics. In AAAI-86: Proc. 5th Nat'l Conf. on AI, Philadelfia, Aug 1986, Vol 2, pp 754-8. Los Altos, CA: Morgan Kaufmann, 1986.

.... Sannela and Wallen, 1992; Schreiweis et al. 1993; Meier and Schimpf, 1993; Kwon et al. 1993) theories (McCabe, 1992) units (Lamma et al. 1991) Several authors have applied concepts of the object oriented programming to achieve structuring of logic programs (Kowalski, 1979; Zaniolo, 1984; Gallaire, 1986; Leonardi et al. 1989; Mello, 1991; McCabe, 1992; Razek, 1992; Xu and Zheng, 1995) Problems are encountered when trying to combine logic databases (modules) Several approaches have been tried, e.g. inheritance (Mello, 1991) context switching (Lamma et al. 1991) introducing implication into ....

Gallaire H. (1986): Merging objects and logic programming: Relational semantics. In: Proc. of AAAI Conference.

....units with transparent minimal interfaces was responded by several authors. Separated logic databases are called modules (Giordano et al., 1992; Sannella and Wallen, 1992; Kwon et al., 1993) theories (McCabe, 1992) units (Lamma et al., 1991) Several authors (Kowalski, 1979; Zaniolo, 1984; Gallaire, 1986; Lamma et al., 1991; McCabe, 1992; Xu and Zheng, 1995) applied concepts of the object oriented programming to achieve structuring of logic programs. Our approach is based on the reflection technique as elaborated by Lamma, Mello, and Natali (Lamma et al., 1991) who used reflection for combining ....

H. GALLAIRE. Merging objects and logic programming: Relational semantics. In Proc. of AAAI Conference, 1986.

....within complex terms (see [26] and [54] for examples) The second approach, which we consider here, is based on the idea of representing an object as a first order logic theory. This view inspired McCabe s Class Template Language [62] and has been adopted by many other authors in the literature ([35, 34, 40, 66, 48] among others) In his Class Template Language McCabe proposes a logical reconstruction of the OO paradigm where objects are interpreted as sets of axioms defining the objects attributes and methods. The same idea can be exploited to model an OO extension of logic programming using embedded ....

H. Gallaire. Merging objects and logic programming: Relational semantics. In AAAI-86 Conference Proceedings, pages 754--758, 1986.

....and the message into a new object. The semantics of this approach was a little bit confused, while, it finds a natural counterpart in the Linear Logic setting, as we will discuss in the next section. Meta programming approaches. Here, we can mention the experimental languages SPOOL [29] and POL [30]. In particular, in the latter, it is possible to declare hierarchies of classes, where each declaration consists of a set of clause, considered as the methods, as in the following example: person person with X:is aged(Y) askuser(age,X,Y) person with X:diplomlevel(Y) ....

H. Gallaire. Merging Objects and logic programming: Relational Semantics. In AAAI 86, pages 754--758, 1986.

....thus have considerable control over message processing. The main difficulty in integrating object oriented paradigm with logic programming is to decide how much of such control can be provided within the declarative and success failure based framework of logic programming. Existing proposals [Zan84, FH86, Gal86] which provide many deterministic controls, do so only at the expense of losing consistency with the declarative nature of logic programming and are usually implemented by meta interpretation. In this paper, we present a practical object oriented logic programming language OOLP , which is ....

....otherwise his semantics is similar to that of OOLP. Our translation is however more compact than his, by not requiring to repeat method definitions for every instance. This compactness enabled us to use the same translation for providing the semantics as well as a fast implementation. Gallaire[Gal86] provides multiple answers, and success failure semantics of messages. He has two types of methods default methods and deterministic methods; only the default methods could be over ridden by subclasses. His method lookup rules are complex requiring more complex implementation than that of ....

H. Gallaire. Merging object and logic programming: relational semantics. In Proceedings of AAAI-86, pages 754--758, Philadelphia, PA, 1986.

....relational database. A deductive language for databases, such as LDL [NT89] consists of a logic language with declarative semantics that manipulates knowledge put in a relational database (see Figure. 1) Here the knowledge is expressed with objects that can be described with binary relations [Gal86]. The LAURE logic language (L 3 ) is presented, which is used to perform queries and positive updates on the database (Section 4) 2 Relational Database Object Oriented Database Logic Language L Binary Relations Queries Updates 3 Figure 1: Logic Languages for Databases The specific data ....

H. Gallaire: "Merging Objects and Logic Programming : Relational Semantics," proceedings AAAI, Philadelphia, 1986.

....and non deterministic, and it is possible not only to search for objects with certain properties but also to do hypothetical reasoning with them. 1 Introduction Many attempts have been made in recent years to extend logic programming with features found in object oriented programming languages [2,3,5,6,12,9]. Much of this work has used Prolog and Horn clause as a foundation. In this paper, we start with an enrichment of Horn clause logic that contains a natural scoping mechanism and then show how aspects of object oriented programming can be represented. Our account of state and state updates is the ....

....The ability to use such straightforward generate and test techniques opens up new possibilities for object oriented systems, and in particular for objectoriented database systems. It is surprising how few papers investigating objects in logic have discussed this possibility; see [9,12] for some discussion. 6.2 Hypothetical Queries In Section 4 it was stated, without justification, that the pairing of implicational goals with the STATE declaration has distinct advantages over assert retract as a method of implementing mutable state. A major advantage is the ability to pose ....

H. Gallaire. Merging objects and logic programming: Relational semantics. In AAAI, pages 754--758, 1986.

No context found.

H, Gallaire, `Merging objects and Logic programming: relational semantics.' Proceedings of the 5th National Conference on Artificial Intelligence (AAAi-86). Philadelphia (PA). August 1986, Morgan Kaufmann Publishers. Los Altos (CA). 1986. pp. 754--758.

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