[RES93]Resnick, Laurie Alperin et al. CLASSIC Description and Reference Manual for the Common LISP Implementation Version 2.1, AT&T Bell Labs, Murray Hill, N.J., May 15, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....decided to use Description Logics (DL) for the construction of the domain model[18] This leads to the need to represent the semantics of temporal expressions in Description Logics. When we started this work in 1999 we investigated the suitability of four DL systems, namely CICLOP [17] CLASSIC [19], FaCT [13] and RACE [10] for the representation of temporal information. At this time only CLASSIC ful lled our requirements. In the following sections we describe the representation of temporal information in our application and discuss what requirements for DL systems arise from it. ....

L.A. Resnick et al., CLASSIC Description and Reference Manual for the COMMON LISP Implementation: Version 2.3 . AI Principles Research Department, AT&T Bell Laboratories, 1995 9

....include the friends of another. However, it should be noted that reasoning with implicit extensional constraints in the current implementation of the T box in KRS is incomplete. It should also be noted that inverse roles, and other features such as role hierarchies, have been added to CLASSIC 2 (Resnick et al. 1993), and Borgida and Patel Shneider (1994) have published an algorithm for subsumption computation in CLASSIC 2 that is proved to be complete under certain restrictions. Inference in CLASSIC consists of propagating conceptual constraints by composing those that form the state of an individual ....

Resnick, L.A., Borgida, A., Brachman, R.J., McGuiness, D.L., Patel-Schneider, P.F. and Zalondek, K.C. (1993). CLASSIC Description and Reference Manual for the COMMON LISP Implementation Version 2.1. Murray Hill, New Jersey, AT&T Bell Laboratories.

.... system (Patel Schneider, McGuiness, Brachman, Resnick and Borgida, 1991) The initial implementation of KRS with the full set of CLASSIC 1 capabilities using a published paper (Borgida et al. 1989) as a design specification took five person weeks in C (Gaines, 1990a) 17 CLASSIC 1 (Resnick, Borgida, Brachman, McGuiness and Patel Schneider, 1990) has a compositional semantics in which complex knowledge structures are composed from eight simple semantic structures: Concepts are abstract objects, each defined completely by its compositional semantics. Primitive concepts are concepts in which the overt definition is incomplete and an ....

Resnick, L.A., Borgida, A., Brachman, R.J., McGuiness, D.L. and Patel-Schneider, P.F. (1990). CLASSIC Description and Reference Manual for the COMMON LISP Implementation Version 1.02. Murray Hill, New Jersey, AT&T Bell Laboratories.

....to determine the nature of the interaction. The results of this determination was then used to suggest replacement widgets from the target graphical userinterface toolkit. This project used the Classic knowledge representation language from AT T [Borgida et al. 1989; Brachman et al. 1990; Resnick et al. 1993]. Classic comprises both a language and a truthmaintenance system capable of automatically inferring implications when new knowledge is added to a model. In particular, as we learned more about the software being analyzed, Classic automatically determined candidate replacement widgets which ....

Resnick, L. A. et al. (1993), CLASSIC Description and Reference Manual for the Common LISP Implementation Version 2.1, AT&T Bell Labs, Murray Hill, N.J.

....agreement and ordering constraints. The syntactic structure is linearized into a string of words. Morphology is handled at this stage. To perform these tasks, the system accesses various knowledge sources. A knowledge base written in CLASSIC, a KL ONE like knowledge representation system [40], describes courses offered in the semester, the user model is also described in CLASSIC and contains information such as which courses the student has already taken, what are his interests and experience. Specific to our approach are a set of topoi and a set of evaluation functions which are used ....

....base and a set of scales on which objects of the knowledge base can be evaluated. We now describe how this knowledge is represented in the system, and how it has been modeled. Information about the classes and the student is represented in a knowledge base implemented in the CLASSIC formalism [40, 2], a KL ONE type of language. The knowledge base contains a collection of objects of different types: class, course, student, teacher, topic and assignment are the most important in our domain. Each object is identified by a set of attributes. For example, the class object has for attributes area, ....

Resnick, L.A. and Borgida, A. and Brachman, R.J. and McGuiness, D.L. and Patel-Schneider R.F. CLASSIC: description and reference manual for the COMMON LISP implementation version 1.02. 1990. 25

....have been conceived with the following biases concerning these two end representations: the domain knowledge base uses a frame like language and the surface sentence generator uses unification with a functional grammar. In the streak prototype, the domain knowledge base is implemented in classic [ Resnick et al. 1990 ] and the surface sentence generator is surge [ Elhadad 1992 ] an realization grammar of English working with the functional unifier fuf [ Elhadad 1990 ] Elhadad 1991 ] 33 Because of these biases and in order to ensure maximum uniformity the three layers are syntactically identical: they ....

....The historical knowledge management system of the complete report generation architecture presented in section 3.3.2 is beyond the scope of the research proposed here. There is therefore no such component in streak. However, streak does include an historical knowledge base implemented in classic [ Resnick et al. 1990 ] Recall from section 3.3.2, that in the proposed architecture the mappers and the reviser must have the ability to query the historical knowledge base. Implementing the historical knowledge base is thus necessary to test the querying capabilities of these three modules which constitute the ....

L.A. Resnick, A. Borgida, R.J. Brachman, D.L. McGuiness, and Patel-Schneider R.F. CLASSIC: description and reference manual for the COMMON LISP implementation version 1.02, 1990.

....the knowledge base, by supplying user Lisp functions. One can check things about the is a hierarchy or the part of hierarchy or whether an individual is a member of some concept or similar questions. For a complete reference of the CLASSIC implementation that we use (without part handling) see [19], and for the part of handling see [15] Chapter 4 Modeling SGML Documents 4.1 Introduction In the two previous chapters we have presented Description Logics and SGML separately. In this chapter we show that we can use Description Logics to represent SGML documents. That is, we can handle ....

Resnick L., Borgida A., Brachman R., McGuinness D., Patel-Schneider P., Zalondek K., CLASSIC Description and Reference Manual for the COMMON LISP Implementation Version 2.2, AT&T Bell Laboratories, Murray Hill, NJ, USA, 1993. BIBLIOGRAPHY 151

....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 include SRL [31] FRAMEKIT [64] PARMENIDES [86] and the commercial system KNOWLEDGECRAFT. The FRL family originated at MIT in the mid 1970s. ....

L.A. Resnick, A. Borgida, R.J. Brachman, D.L. McGuinness, P.F. Patel-Schneider, and K.C. Zalondek. CLASSIC description and reference manual for the Common Lisp implementation, version 1.1. Unpublished system manual, 1991.

....Condorcet or during operation (see chapter 5) Consistency of knowledge plays an important role when knowledge is updated. Knowledge Representation Systems (KRSs) are designed to manage knowledge (Nebel [1990] Speel [1995] Description Logics (DLs) based KRSs, e.g. BACK (Hoppe et al. 1993] CLASSIC (Resnick et al. 1995]) CRACK (Bresciani, Franconi Tessaris [1995] contain inferences to check whether a newly added concept is consistent with the knowledge base. Since this is a highly desirable feature of the knowledge representation within Condorcet, we will investigate whether such DLs based systems are ....

L.A. Resnick, A. Borgida, R.J. Brachman, D.L. McGuinnes, P.F. Patel-Schneider & K.C. Zalondek [December, 1995], CLASSIC description and reference manual for the COMMON LISP implementation version 2.3, AT&T Bell Laboratories, Murray Hill, NJ.

....] Elhadad 1991 ] and a grammar of English 12 . The functional unifier fuf also drives all the rule based components of the system. Although streak does not currently have a knowledge base management system, it does have a small basketball knowledge base. The latter is implemented in classic [ Resnick et al. 1990 ] and it can be queried by the other components. In the following sections I first sketch a walk through the system. I then provide more detailed information on each level of representation and each processing component. I then explain where and when the subtasks defined in section 2.1 are carried ....

L.A. Resnick, A. Borgida, R.J. Brachman, D.L. McGuiness, and Patel-Schneider R.F. CLASSIC: description and reference manual for the COMMON LISP implementation version 1.02, 1990.

....are reduced to subsumption. Hence, major efforts were devoted to the study of the subsumption problem in the context of different terminologies ( 22, 37, 46, 33] to the study of subsumption classification algorithms in existing systems ( 2, 31] and to the development of subsumption algorithms ([44, 17, 47]. The conclusion of this intensive study of subsumption is that keeping subsumption sound, complete, and tractable is not feasible, and some criteria must be relaxed. That is, in order to keep the subsumption problem tractable, the set of term forming operators has to be severely limited ( 46, 36, ....

....reasoner is incorporated, possibly as a black box. 6. 1 DL subsumption algorithms as Correct F logic s Inference Algorithms We shortly consider two approaches for checking subsumption and coherence: The constraints based approach of [47] and the normalize compare algorithms of CLASSIC ([44]) and of [32] We show that these approaches can be simulated by similar F logic inference algorithms, that apply to descriptions written in a DFL, and all properties of the algorithms are preserved. The purpose of this section is to show that, computationally, nothing is lost by considering a ....

[Article contains additional citation context not shown here]

L.A. Resnick, A. Borgida, R.J. Brachman, D.L. McGuinness, and P.F. Patel-Schneider. Classic description and reference manual for common lisp implementation. Technical Report Version 1.02, AT&T Bell Labs, 1990.

....a means for expressing implicit knowledge, that extends the explicitly given facts. In DLs, although there is a growing agreement that rules are essential, there is no agreement on an integration framework, and the standard formal treatment is restricted to descriptions. Indeed, some systems (like [55,29]) manipulate also terminological rules, but they are added on a procedural operational basis, and are not used for reasoning with analytic descriptions, or in the contrapositive direction. The formal status of rules within such systems is opaque. Other approaches try to compile rules into the DL ....

....are reduced to subsumption. Hence, major efforts were devoted to the study of the subsumption problem in the context of different terminologies ( 33,48,59,43] to the study of subsumption classification algorithms in existing systems ( 8,41] and to the development of subsumption algorithms ([55,28,1]. The conclusion of this intensive study of subsumption is that keeping subsumption sound, complete, and tractable is not feasible, and some criteria must be relaxed. That is, in order to keep the subsumption problem tractable, the set of term forming operators has to be severely limited ....

[Article contains additional citation context not shown here]

L. Resnick, A. Borgida, R. Brachman, D. McGuinness, and P. Patel-Schneider. Classic description and reference manual for common lisp implementation. Technical Report Version 1.02, AT&T Bell Labs, 1990.

....time, formal derivations with incomplete conceptual information must be supported. The paper assumes basis knowledge about DL (see e.g. Woods and Schmolze (1992) for an introduction) The knowledge bases presented in this paper are based on a concrete DL implementation: the CLASSIC system (Resnick et al. 1993). The basic knowledge base is called HAMVIS Upper Model. In the spirit of the Penman Upper Model (Bateman et al. 1990) this knowledge base structures basic concepts for an application class in a way that is suited to communication purposes. However, in this paper, we limit the presented section ....

Resnick, L.A., Borgida, A., Brachman, R.J., McGuiness, D.L., Patel-Schneider, P.F., Zalondek, K.C., CLASSIC Description and Reference Manual for the Common Lisp Implementation, Version 2.2, 1993.

....of description (terminological) operators, and denotes concepts or roles ( 7, 30, 42] The status of descriptions, and the emphasis on direct semantics is the major distinction between DLs to other logics in AI. Rules are added to Description systems on a procedural operational basis (e.g. [36, 21]) as a means for extending their expressivity. There is no agreement on an integration framework, and the standard formal treatment is restricted to descriptions. Other approaches try to compile rules into the DL approach ( 15] or to extend a rules framework with a classification mechanism ....

....to the problem of coherency. Major efforts were devoted to the study of the subsumption problem in the context of different terminologies ( 24, 34, 38, 33] to the study of subsumption classification algorithms in existing systems ( 5, 31] and to the development of subsumption algorithms ([36, 20, 39]. These research efforts show that subsumption is tractable only if the set of term constructors is severely limited. Inferencing in DLs is essentially different from standard inference in AI, or in logic databases, that operate under the Closed World Assumption (CWA) The main point of diversion ....

L. Resnick, A. Borgida, R. Brachman, D. McGuinness, and P. Patel-Schneider. Classic description and reference manual for common lisp implementation. Technical Report Version 1.02, AT&T Bell Labs, 1990.

....To detect errors: It is possible to determine whether two descriptions are disjoint, whether a description is incoherent or not, and whether ascribing a description to an individual leads to an inconsistency. Quite a number of KBMSs based on description logics have been built, including classic (Resnick et al. 1992), loom (MacGregor Bates, 1987) and back (Peltason et al. 1987) Such systems have been used in several practical situations, including software information bases (Devanbu et al. 1991) financial management (Mays et al. 1987) configuration management (Owsnicki Klewe, 1988; Wright et al. ....

Resnick, L. A., Borgida, A., Brachman, R. J., McGuinness, D. L., & Patel-Schneider, P. F. (1992). CLASSIC description and reference manual for the COMMON LISP implementation. AI Principles Research Department, AT&T Bell Laboratories.

....description logics (also called terminological logics) 1 ] expressively limited to ensure good computational properties, description logic based because of the desirable representational properties of description logics. There are two currently supported members of the family, lisp classic [ 17 ] and NeoClassic [ 16 ] and one older member c classic [ 19 ] We will be referring to characteristics of both of the current members in this paper, as currently neither dominates the other in the characteristics we are concerned with here. The classic family, and Description Logics in gen ....

Lori Alperin Resnick, Alex Borgida, Ronald J. Brachman, Deborah L. McGuinness, and Peter F. PatelSchneider. CLASSIC description and reference manual for the COMMON LISP implementation: Version 2.3. AI Principles Research Department, AT&T Bell Laboratories, 1995.

....for use in a university course on knowledge representation and gathered student feedback. We also wrote two demonstration applications [91, 92, 7, 24] and presented this work and gathered feedback on numerous occasions. An explanation system has been implemented in the research version of classic [103, 16]. A limited subset has been integrated into the development version of classic [125] and our basic design is currently being integrated into the new (C ) version called neoclassic [99] 1.4 Thesis Outline This thesis is a discussion of the underlying principles of the explanation and filtering ....

L. Alperin Resnick, A. Borgida, R.J. Brachman, D.L. McGuinness, P.F. PatelSchneider, C. Isbell, and K.Zalondek. classic description and reference manual for the Common Lisp implementation: Version 2.3. AI Principles Research Department, AT&T Bell Laboratories. 1995.

No context found.

[RES93]Resnick, Laurie Alperin et al. CLASSIC Description and Reference Manual for the Common LISP Implementation Version 2.1, AT&T Bell Labs, Murray Hill, N.J., May 15, 1993.

No context found.

L. Resnick, A. Borgida, R. Brachman, D. McGuinness, P. Patel-Schneider, K. Zalondek. CLASSIC Description and Reference Manual For the COMMON LISP Implementation, Version 1.1. Technical Report. ATT Bell Laboratories, Murray Hill, NJ.

No context found.

L.A. Resnick, A. Borgida, R.J. Brachman, D.L. McGuinness, P.F. Patel-Schneider and K.C. Zalondek, CLASSIC Description and Reference Manual for the COMMON LISP Implementation, Version 2.2 (1993) 41

No context found.

L. Resnick et al., CLASSIC Description and Reference Manual for the Common LISP Implementation (Murray Hill, N.J.: AT&T Bell Laboratories, 1993).

No context found.

L.A. Resnick, A. Borgida, R.J. Brachman, D.L. McGuinness, P.F. Patel-Schneider, and K.C. Zalondek. Classic description and reference manual for the Common Lisp implementation, Version 2.2, December 1993.

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