Vilain, M. The Restricted Language Architecture of a Hybrid Representation System. Proceedings of UCAI85, International Joint Conferences on Artificial Intelligence, Inc., Los Angeles, CA, August, 1985, pp. 547-551.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....formal semantics for specification of descriptive constants and axioms relating them. Remarkably, 99.9 of 7,000 vocabulary items in our natural language applications could be adequately axiomatizad in the taxonomic language. 1. Introduction Hybrid representation systems have been expietad before [9, 24, 31], but until now only one has been used in an extensive natural language processing system. KL TWO [31] based on a prepositional logic, was at the core of the mapping from formulae to lexical items in the Penman generation system [28] In this paper we report some of the design decisions made in ....

....vocabulary items in our natural language applications could be adequately axiomatizad in the taxonomic language. 1. Introduction Hybrid representation systems have been expietad before [9, 24, 31] but until now only one has been used in an extensive natural language processing system. KL TWO [31], based on a prepositional logic, was at the core of the mapping from formulae to lexical items in the Penman generation system [28] In this paper we report some of the design decisions made in creating a hybrid of an intensional logic with a taxonomic language for use in Janus, BBN s natural ....

[Article contains additional citation context not shown here]

Vilain, M. The Restricted Language Architecture of a Hybrid Representation System. Proceedings of UCAI85, International Joint Conferences on Artificial Intelligence, Inc., Los Angeles, CA, August, 1985, pp. 547-551.

....interpreter in enforcing selectional restrictions and producing a logical form as the meaning representation of the input sentence. IRACQ makes extensive use of information present in a model of the domain, which is represented using NIKL [18, 21] the terminological reasoning component of KL TWO [26]. Information from the domain model is used in guiding the IRACQJuser interaction, assuring that acquisition and editing yield IRules consistent with the model. Further support exists for the IRule developer through a flexible editing and debugging environment. IRACQ has been in use by non AI ....

Vilain, M. The Restricted Language Architecture of a Hybrid Representation System. Proceedings of IJCAI85, International Joint Conferences on Artificial Intelligence, Inc., Los Angeles, CA, August, 1985, pp. 547-551.

....( x . 300) is returned. 9. Related Work Systems that in some way combine logic and objects can be distinguished in two broad categories. The first category includes hybrid knowledge representation systems that integrate notions from objects into logic. e.g. systems like KRYPTON [28] and KL TWO [29], use the notion of the hierarchy of concepts in their terminological component, and a FOPC based language in their assertional one. The unification algorithm is extended to take the information in the terminological component into account. Also, systems like [24] LOGIN [30] and Taxlog [27] ....

M. Vilain, The Restricted Language Architecture of a Hybrid Representation System, Proceedings of the 9th IJCAI, (1985) 547-551.

....such as consistency checking, subsumption checking, retrieval, and querying. 1 Introduction and Motivation In the last decade many knowledge representation systems in the tradition of kl one [BS85] have been built, for example back [NvL88, Neb90] classic [BBMR89] kandor [Pat84] kl two [Vil85] krypton [BPGL85] loom [MB87] nikl [KBR86] sb one [Kob89] A common feature of these systems is the separation of the knowledge into a terminological part and an assertional part. Knowledge about classes of individuals and relationships between these classes is stored in the TBox, and ....

M. B. Vilain. \The restricted language architecture of a hybrid representation system." In R. J. Bachmann, H. J. Levesque, R. Reiter (editors), Proceedings of the 9th IJCAI, pp. 547-551, Los Angeles, Cal., 1985.

....The rst terminological representation system, kl one [7] was an implementation of Brachman s [5] work on structured inheritance networks. In the last decade many knowledge representation systems based on these ideas have been built, for example back [37] classic [36] kandor [34] kl two [42], k rep [30] krypton [6] kris [3] loom [29] meson [13] nikl [41] sb one [23] and yak [10] Moreover, formal aspects of ter1 minological representation languages have been thoroughly investigated, with the highest emphasis having been placed on the decidability and complexity of the ....

M. B. Vilain. The restricted language architecture of a hybrid representation system. In IJCAI-85 [20], pages 547-551.

....track of all questions asked about an individual as part of the previous processing ( hits and misses ) and if answers to these do not change as a result of the update then no re processing is needed. Another alternative is to use an elaborate truth maintenance system (as available in kl two (Vilain, 1985)) for each kind of judgment. In our opinion, both these approaches might however become very expensive in terms of space and often computation time, because they maintain too many details. We follow an intermediate stance, first suggested by Peter Patel Schneider for the classic implementation, ....

Vilain, M. (1985). The restricted language architecture of a hybrid representation system. In Proceedings of IJCAI'85.

....the facilities of representing concepts and roles. In the last decade, AI researchers have identified a subset of first order logic language, called terminological logic 1 , to represent and reason about concepts and roles efficiently. Some famous systems of this kind include KL ONE[5] KL TWO[25], BACK[17, 16] CLASSIC[4] and so on. Though terminological logics have proved to be an 1 Some alias include concept logic, description logic, or term subsumption logic. effective way of knowledge representation and reasoning, they in general lack the mechanism of uncertainty management. In ....

M.B. Vilain. "The restricted language architecture of a hybrid representation system". In R.J. Brachman, H.J. Levesque, and R. Reiter, editors, Proceedings of the 9th IJCAI, pages 547--551, 1985.

....Work ALL draws from several diverse fields. We attempt only to sketch in general terms the fields from which it draws and discuss a few particularly relevant past approaches. ALL draws from semantic networks [Brachman et al. 83, Bobrow Winograd, 77, Findler, 79, Quillian, 67, Shapiro, 89, Vilain, 85] the intuition that retrieval and reasoning can be guided and limited by the structure of the network. This has long been a key intuition behind semantic networks: the knowledge required to perform an intellectual task generally lies in the semantic vicinity of the concepts involved in the ....

....6 CONCLUSION 19 used the structure of the network only for special purpose reasoning (spreading activation, classification etc. and has relied on a first order logic theorem prover [Brachman et al. 83, Schubert et al. 83] or a weaker deduction system [Levesque, 84, Patel Schneider, 85, Vilain, 85] for general reasoning. A notable exception to this generalization is the recent work of Haan and Schubert [Schubert, 79, Haan Schubert, 86] ALL and the networks of Schubert share several features including the use of access limitations to guide reasoning. The most obvious way to use the ....

Vilain, M. (1985). The restricted language architecture of a hybrid representation system. IJCAI85, pp. 547-551.

....track of all questions asked about an individual as part of the previous processing ( hits and misses ) and if answers to these do not change as a result of the update then no re processing is needed. Another alternative is to use an elaborate truth maintenance system (as available in KL TWO [26]) for each kind of judgement. In our opinion, both these approaches might however become very expensive in terms of space and often computation time, because they maintain too many details. ProtoDL follows an intermediate stance, first suggested by Peter Patel Schneider for the Classic ....

Vilain, M., `The Restricted Language Architecture of a Hybrid Representation System', IJCAI-85, pp 547-551, 1985.

....maintenance of formula validity, are not well suited for dealing with attribute values in object based models, and require too much storage space for being employed for large object bases. In the context of terminological systems, an early solution to the retraction problem was provided by KL TWO [Vil85] It consisted of a purely terminological component (not supporting object management) and, as its assertional component, a version of RUP [McA82] a reason maintenance system supporting propositional logic. Although an elegant solution with respect to the retraction problem, the two components ....

Marc B. Vilain. The restricted language architecture of a hybrid representation system. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, pages 547--551, Los Angeles, Cal., August 1985.

.... et al. 1984] explainable expert systems [Neches et al. 1985] natural language processing [Webber and Bobrow, 1980; Sondheimer and Nebel, 1986] and computer configuration [Owsnicki Klewe, 1988] Based on these ideas, a number of system were built, e.g. kandor [PatelSchneider, 1984] kl two [Vilain, 1985; Schmolze, 1989] krypton [Brachman et al. 1985] meson [Edelmann and Owsnicki, 1986] back [von Luck et al. 1987; Nebel and von Luck, 1988] loom [MacGregor, 1988] classic [Brachman et al. 1989; Borgida et al. 1989] and sb one [Kobsa, 1989] and the formal properties of these systems ....

Marc B. Vilain. The restricted language architecture of a hybrid representation system. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, pages 547--551, Los Angeles, Cal., August 1985.

....of the representation system. 5. Therefore, representation systems should restrict taxonomic classification to terminological definitions alone. We call thesis (5) the restricted classification thesis. These theses were promulgated in the context of the descendants of kl one [8, 37] namely nikl [41, 26, 15] (the New Implementation of KL one) kl two [41] kandor [30] Doyle Patil krypton [6] and back [42, 27] While kl one itself was designed earlier, without concern for language restrictions, the designs of krypton, kandor, and back involved theoretical analyses (e.g. 19] and [27] to see ....

....systems should restrict taxonomic classification to terminological definitions alone. We call thesis (5) the restricted classification thesis. These theses were promulgated in the context of the descendants of kl one [8, 37] namely nikl [41, 26, 15] the New Implementation of KL one) kl two [41], kandor [30] Doyle Patil krypton [6] and back [42, 27] While kl one itself was designed earlier, without concern for language restrictions, the designs of krypton, kandor, and back involved theoretical analyses (e.g. 19] and [27] to see what linguistic constructs could be efficiently ....

[Article contains additional citation context not shown here]

M. B. Vilain. The restricted language architecture of a hybrid representation system. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 547--551, 1985.

....The first terminological representation system, kl one [7] was an implementation of Brachman s [5] work on structured inheritance networks. In the last decade many knowledge representation systems based on these ideas have been built, for example back [37] classic [36] kandor [34] kl two [42], k rep [30] krypton [6] kris [3] loom [29] meson [13] nikl [41] sb one [23] and yak [10] Moreover, formal aspects of terminological representation languages have been thoroughly investigated, with the highest emphasis having been placed on the decidability and complexity of the ....

M. B. Vilain. The restricted language architecture of a hybrid representation system. In IJCAI-85 [20], pages 547--551.

....STROBE [88, 90, 91] CLASS, RLL [35, 34] CYCL [47, 49, 48] ARLO [37] THEO [57] JOSIE [60] OPUS [28] and the commercial systems KEE [42] and KAPPA. The KL ONE family originated at Harvard University in the early 1970s. Its members include KL ONE [15] NIKL [41, 6, 76] KANDOR [65] KL TWO [98], K REP [52] KREME [2] BACK [67, 99] MUNIN, SPHINX, KRIS [4] MESON, SB ONE [43] KRYPTON [13] LOOM [101, 40, 51] and CLASSIC [12, 14, 69] See [76, 51, for historical overviews of the KL ONE family. The SRL family originated at Carnegie Mellon University in the early 1980s. Its members ....

....6 Synonyms: superclass and subclass (PROTEUS) 7 Synonyms: member (PROTEUS) 8 NIKL does define individual class frames as classes that have only a single member but classes nonetheless. To reason about individual objects a user must employ an additional system, for example KL TWO [98] combines NIKL with a propositional reasoning system called RUP [54] ffl Descriptions These frames are variablized classes that are employed in the UNIT Package to represent goals in planning problems [93] CLASS also has indefinites. ffl Prototypes KRL, RLL, and JOSIE employ prototype ....

M. Vilain. The restricted language architecture of a hybrid representation system. In Proceedings of the 1985 International Joint Conference on Artificial Intelligence, pages 547--551. Morgan Kaufmann Publishers, 1985.

....of a representation formalism and the complexity of the corresponding inference mechanisms. Thus, it makes sense to use weak specialized languages that, while being constrained to parts of the domain to be represented, allow efficient inference mechanisms ( restricted language hybrid reasoners (Vilain 1985)) Different types of hybrid systems result depending on how the representation involved are combined. The simplest type is the coexistence of different paradigms that communicate through a pre defined interface. Most of the early commercial products such as KEE, ART, etc. are in this category. ....

Vilain, M. (1985). The restricted language architecture of a hybrid representation system.

....the RMS to systems using it. The original RMS architectures make reason maintenance the base level stratum upon which all other reasoning procedures are erected. To enable belief revision, one must encode every bit of information that might change in reasons and tell these reasons to the RMS (cf. [25, 28]) This can present an excessive burden, as manifest by the observation that the RMSs supplied in expert system shells all too often go unused. If one must apply it to every step of reasoning, at every level down to the smallest inference, reason maintenance becomes a demanding duty rather than a ....

M. B. Vilain. The restricted language architecture of a hybrid representation system. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 547-- 551, 1985.

.... and expectations (see [13] are: ffl Wider representational and inferential mechanisms: Non taxonomic relations like connectivity, n ary relations ( 34, 35, 3] part whole relations ( 10] higher order constructs ( 30] collective entities ( 9] default assumptions and subsumption ( [31, 1, 25, 27, 8] ) intensions and views ( 35] cyclic terminological de nitions ( 11, 12, 24] and self references ( 33] ffl More AEexible de nitions ( 8, 35] ffl Uniform proof theory ( 32] ffl Integration with logic programming, object oriented systems, functional programming, and database ....

....and nonmonotonic inheritance reasoning: A forst step. In Working notes, AAAI Fall Symposium on Issues in Description Logics, pages 6471, 1992. 26] P.F. Patel Schneider. Small can be beautiful in knowledge representation. In Proceedings of the 1983 KL ONE Workshop, Denver, Colorado, 1984. [27] P.F. Patel Schneider. Defaults and descriptions. In Working notes, AAAI Fall Symposium on Issues in Description Logics, pages 7475, 1992. 28] P.F. Patel Schneider. Partial reasoning in knowledge representation systems based on description logics. In Working notes, AAAI Fall Symposium on Issues ....

[Article contains additional citation context not shown here]

M. Vilain. The restricted language architecture of a hybrid representation system. In Proceedings

....of a hybrid formalism suggests that its usage has some impact on knowledge represented with another subformalism (according to the common semantics) then this should be realized by the reasoning component of the underlying system. An example for a system with unbalanced subformalisms is KL TWO [23]: While it is possible to define concepts with a very rich language, only a fraction of it is used for stating contingent propositions. In particular, the number restrictions used in the NIKL subformalism has only a very limited impact on the PENNI subformalism because the latter is not ....

....reference (Bedeutung) were developed. In particular, the connection of KL ONE [3] derivates as formalisms for representing terminological knowledge (TBoxes) with formalisms for representing assertions about the actual state of the world (ABoxes) has been investigated 3 (e.g. KRYPTON [4] KL TWO [23], MESON [5] BACK [11] and KANDOR [17] The main points in this research were the design of an appropriate ABox, sometimes requiring severe restrictions of the expressivity in the TBox (e.g. in KRYPTON) and developing means for connecting the reasoning of TBox and ABox. In the following we will ....

[Article contains additional citation context not shown here]

Marc B. Vilain, "The Restricted Language Architecture of a Hybrid Representation System," Proc. 9th IJCAI, Los Angeles, Cal., 1985, pp. 547--551.

....from several diverse fields and we will not have space here to examine in detail its relationship to the large body of previous work. We will simply sketch in general terms the fields from which it draws and a few particularly relevant past approaches. ALL draws from semantic networks [8] 4] 5] [24] the intuition that retrieval and reasoning can be guided by the structure of the network. This has long been a key intuition behind semantic networks: the knowledge required to perform an intellectual task generally lies in the semantic vicinity of the concepts involved in the task. 21] ....

....mechanism which is guided by the structure of the network. Past work has generally used the structure of the network only for special purpose reasoning (spreading activation, classification etc. and has relied on a first order logic theorem prover [4] 22] or a weaker deduction system [15] 19] [24] for general reasoning. A notable exception to this rule is the recent work of Schubert [21] 9] ALL and the networks of Schubert share several features including the use of access limitations to guide reasoning. The most obvious way to use the structure of a semantic network to limit access ....

Vilain, M. (1985). The restricted language architecture of a hybrid representation system. In Proc. Int. Jt. Conf. Artif. Intell., Los Angeles, California, pp. 547-551.

....space here to examine in detail its relationship to the large body of previous work. We simply sketch in general terms the fields from which it draws and a few particularly relevant past approaches. ALL draws from semantic networks [ Findler, 1979, Brachman et al. 1983, Bobrow and Winograd, 1985, Vilain, 1985 ] the intuition that retrieval and reasoning can be guided by the structure of the network. This has long been a key intuition behind semantic networks: the knowledge required to perform an intellectual task generally lies in the semantic vicinity of the concepts involved in the task. ....

....generally used the structure of the network only for special purpose reasoning (spreading activation, classification etc. and has relied on a first order logic theorem prover [ Brachman et al. 1983, Schubert et al. 1983 ] or a weaker deduction system [ Levesque, 1984, Patel Schneider, 1985, Vilain, 1985 ] for general reasoning. A notable exception to this rule is the recent work of Schubert [ Schubert, 1979, Haan and Schubert, 1986 ] ALL and the networks of Schubert share several features including the use of access limitations to guide reasoning. The most obvious way to use the structure of a ....

Vilain, M. The restricted language architecture of a hybrid representation system. In Proc. Int. Jt. Conf. Artif. Intell., Los Angeles, California, 1985, pp. 547-551.

.... one can say that Peter is a fortune hunter, who loves Mary, using the assertions Peter : Fortune hunter and Peter loves Mary: Various terminological systems have been designed and implemented that are based on the ideas underlying kl one, for example, back [21] classic [6] kandor [20] kltwo [27] k rep [18] krypton [5] kris [3] loom [17] meson [9] nikl [12] sb one [14] Representing knowledge of an application domain with such a system amounts to introducing the terminology of this domain via concept definitions, and then describing (an abstraction of) the relevant part of the ....

M. Vilain. The restricted language architecture of a hybrid representation system. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, pages 547--551, Los Angeles, Calif., 1985.

No context found.

M. Vilain. The restricted language architecture of a hybrid representation system. In Proceedings of IJCA[-85, Los Angeles, Ca., pp. 547-551. IJCAI, 1985.

No context found.

Vilain, M. (1985). The restricted language architecture of a hybrid representation system. IJCAI-85, pp. 547-551.

No context found.

Vilain, M., "The Restricted Language Architecture of a Hybrid Representation System," Proc. IJCAI-85, Los Angeles, 1985, pp. 547--551.

No context found.

Marc B. Vilain (1985). The restricted language architecture of a hybrid representation system. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, pages 547--551, Los Angeles, CA.

First 50 documents

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