Hideyuki Nakashima. Knowledge representation in Prolog/KR. In Proc. of 1984 International Symposium on Logic Programming. IEEE, 1984. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Version 1.0 Manual - Revision Cooperative Architecture (Correct)
....environment are valid unless they are explicitly negated by programs in shallower cells. This mechanism can be used to inherit programs from other cells. In fact, the structure of the cells can be viewed as a dynamically formed version of IS A hierarchy frequently used in knowledge representation[Nak84]. It is possible to set up a system using an original program when a newly added one fails. GAEA is designed as such. By forming multiple cells into a certain structure, infons can interact each other to yield new information. IMPORTANT: GAEA Version 2 largely differs from previous versions in ....
Hideyuki Nakashima. Knowledge representation in Prolog/KR. In Proc. of 1984 International Symposium on Logic Programming. IEEE, 1984.
Version 2.3 Manual - Revision Cooperative Architecture (Correct)
....environment are valid unless they are explicitly negated by programs in shallower cells. This mechanism can be used to inherit programs from other cells. In fact, the structure of the cells can be viewed as a dynamically formed version of IS A hierarchy frequently used in knowledge representation[Nak84]. 18 CHAPTER 3. GAEA LANGUAGE It is possible to set up a system using an original program when a newly added one fails. GAEA is designed as such. By forming multiple cells into a certain structure, infons can interact each other to yield new information. IMPORTANT: GAEA Version 2 largely ....
Hideyuki Nakashima. Knowledge representation in Prolog/KR. In Proc. of 1984 International Symposium on Logic Programming. IEEE, 1984.
Abstract Metaprolog Engine - Cicekli (1994) (Correct)
....concept represents the derivability relationship holding between viewpoints and statements. Furukawa et al. 28] also use theories to represent logic databases, and they implement the derivability relation between these logic databases and statements. Worlds in Nakashima s Prolog KR system [29] are also very similar to theories in the MetaProlog system. 4 y y y y y base theory T1 T2 T3 T4 I I FIGURE 2.1. A Theory Tree in The MetaProlog System Lamma et al. 22, 23] use contexts to represent multiple theories in logic programming framework. They also extent the Warren Abstract ....
Nakashima, K., Knowledge Representation in Prolog/KR, in: Proc. of the 1984 Int. Symp. on Logic Programming, IEEE Computer Society Press, Washington D.C., 32 1984, pp. 126-130.
Combining Object-Oriented and Logic Paradigms: A Modal Logic.. - Uustalu (1992) (6 citations) (Correct)
....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 readily available in Prolog) In CPU [MN87] the user has to metaprogram the inheritance semantics. Our proposal, MU, falls under the third group of ....
H. Nakashima. Knowledge representation in Prolog/KR. In Proc. 1984 Int'l Symp. on Logic Programming, Atlantic City, Feb 1984, pp 126-30. Silver Spring, MD: IEEE Comp. Soc. Press, 1984.
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