Mays, E., Apt'e, C., Griesmer, J., & Kastner, J. (1987). Organizing knowledge in a complex financial domain. IEEE Expert, 2, 61--70.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... 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. 1993) and data exploration. Additional signs that DLs are significant subjects of study are the several recent workshops on DLs (Nebel et al. 1991; Peltason et al. 1991; AAAI, 1992) 1.1 On the Tractability and Completeness of DL ....

Mays, E., Apt'e, C., Griesmer, J., & Kastner, J. (1987). Organizing knowledge in a complex financial domain. IEEE Expert, 2, 61--70.

.... only are they the subject of theoretical investigation within the field of knowledge representation, but they also find use in practical knowledge based systems (Beck et al. 1989; Borgida, 1992; Borgida Patel Schneider, 1992; Brachman et al. 1983; Cohen Hirsh, 1994b; Devanbu et al. 1991; Mays et al. 1987; Patel Schneider, 1989) 1.1. Classic Classic permits constructing certain quantified descriptions that distinguish a particular subset of a domain I of individuals. Classic descriptions contain primitive symbols which get mapped to arbitrary subsets of I, disjoint primitive symbols which get ....

Mays, E., Apte, C., Griesmer, J., & Kastner, J. (Fall 1987). Organizing knowledge in a complex financial domain. IEEE Expert, (pp. 61--70).

....model of learnability will be used only in positive results. 3 The CoreClassic description logic Our initial results are concerned with the DL CoreClassic. CoreClassic is a subset of Classic, a DL that has been implemented and used in real applications [ Beck et al. 1989; Devanbu et al. 1991; Mays et al. 1987; Schewe, 1989 ] We chose this subset because it accurately illustrates the complexities that arise in learning DLs: in particular, the learning algorithm of Section 5 and the hardness results of Section 4 extend to full Classic [ Cohen and Hirsh, in preparation ] Because this representation ....

E. Mays, C. Apte, J. Griesmer, and J. Kastner. Organizing knowledge in a complex financial domain. IEEE Expert, pages 61--70, Fall 1987.

....solving, or user knowledge as in [16] or [15] In any case, the explanation is often presented as a chain of inferences by which a conclusion was reached. Description Logic based Systems (DLs) are another knowledge representation and reasoning technology that is increasingly used in applications [13, 10, 20, 7]. One benefit of DLs is that they have a richer representation formalism than standard rule based systems; at the same time, their reasoning mechanisms are both more extensive and more intricate. Moreover, for efficiency reasons, DLs are often implemented procedurally using all sorts of optimized ....

E. Mays, C. Apte, J. Griesmer, J. Kastner. Organizing Knowledge in a Complex Financial Domain. In IEEE Expert, Fall 1987, 61--70.

....properties that make them useful in this context. First, they have been in existence for over a decade and have been used in a variety of practical applications, ranging from database interfaces [Beck et al. 1989] to software information bases [Devanbu et al. 1991] to financial management [Mays et al. 1987]. Thus, there is good reason to believe that learning systems that use DLs as a representation language will also be useful. Second, there exists a wealth of formal results concerning the tractability of various types of reasoning in DLs. This is of interest because some of the constructs known ....

....of various subsets of the description language used in the knowledge representation system Classic. Classicaspires to be maximally expressive while maintaining tractability, and has furthermore been fully implemented and used in real applications [Beck et al. 1989; Devanbu et al. 1991; Mays et al. 1987; Schewe, 1989] Unfortunately, a language that supports tractable reasoning need not be tractably learnable [Cohen et al. 1992] In previous work [Cohen and Hirsh, 1992] we considered the learnability of a subset of Classic called CoreClassic. CoreClassic is an extremely simple description ....

E. Mays, C. Apte, J. Griesmer, and J. Kastner. Organizing knowledge in a complex financial domain. IEEE Expert, pages 61--70, Fall 1987.

....natural concepts. 1 INTRODUCTION One well known family of formalisms for representing knowledge are description logics, sometimes also called terminological logics or KL ONE type languages. Description logics have been applied in a number of contexts [ Beck et al. 1989; Devanbu et al. 1991; Mays et al. 1987; Wright et al. 1993 ] additionally, the complexity of deductive reasoning using description logics is fairly well understood. Recently we have begun to analyze the complexity of using description logics to support inductive reasoning i.e. learning. Our analysis has focused on determining ....

E. Mays, C. Apte, J. Griesmer, and J. Kastner. Organizing knowledge in a complex financial domain. IEEE Expert, pages 61--70, Fall 1987.

.... e.g. sb one [ Kobsa, 1989 ] However, its success in this area has also led to applications in other fields (see e.g. meson [ Edelmann and Owsnicki, 1986 ] which is used for computer configuration tasks, classic [ Borgida et al. 1989 ] which is e.g. used in the area of cad cam, or K Rep [ Mays et al. 1987; Mays et al. 1988 ] which is used in a financial marketing domain) A drawback which pure kl one languages have is that all the terminological knowledge has to be defined on the abstract logical level. In many applications, one would like to be able to refer to concrete domains and predicates on ....

E. Mays, C. Apt'e, J. Griesmer, and J. Kastner. Organizing knowledge in a complex financial domain. IEEE Expert, 2(3):61--70, 1987.

.... logics (DLs) or terminological logics are a family of knowledge representation and reasoning systems that have found applications in several diverse areas, ranging from database interfaces [ Beck et al. 1989 ] to software information bases [ Devanbu et al. 1991 ] to financial management [ Mays et al. 1987 ] They have also received considerable attention from the research community (e.g. Woods and Schmolze, 1992 ] DLs are to used to reason about descriptions, which describe sets of atomic elements called individuals. Individuals can be organized into primitive classes, which denote sets ....

E. Mays, C. Apte, J. Griesmer, and J. Kastner. Organizing knowledge in a complex financial domain. IEEE Expert, pages 61--70, Fall 1987.

....a convenient technique for modeling the semantics of an application domain and the semantics of the data, legacy data is usually present in some existing DBMS (at best, a relational one) We must therefore address the issue of retrieving the answer from such databases. One approach, followed in [55, 50], is to model as part of the KB the relations in the database as well as their relationship to the concepts in the semantic model, and then build a component that takes a DL query, transforms it into a query against the DBMS, and returns the answer. Another approach, suitable in cases when there ....

E. Mays, C. Apte, J. Griesmer, J. Kastner. "Organizing knowledge in a complex financial domain ", IEEE Expert, 1987, pp.61--70.

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