15 citations found. Retrieving documents...
J. Edelmann and B. Owsnicki. Data models in knowledge representation systems: A case study. In Proceedings of the Tenth German Workshop on Arti cial Intelligence (GWAI'86) and the Second Austrian Symposium on Arti cial Intelligence (  OGAI'86), vol. 124 of Informatik-Fachberichte, pages 69-74. Springer Verlag, 1986.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
An Empirical Analysis of Optimization Techniques.. - Baader.. (1992)   (59 citations)  (Correct)

....[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 subsumption problem [24, 31, 39, 35, 33, 40, 11, 12] As a result ....

J. Edelmann and B. Owsnicki. Data models in knowledge representation systems: A case study. In C.-R. Rollinger and W. Horn, edi42 tors, GWAI-86 und 2.  Osterreichische Articial-Intelligence-Tagung, pages 69-74, Ottenstein, Austria, Sept. 1986. Springer-Verlag.


Terminological Cycles: Semantics and Computational Properties - Nebel (1991)   (83 citations)  (Correct)

.... 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 were investigated [Schmolze and Israel, 1983; Brachman and Levesque, 1984; ....

Jurgen Edelmann and Bernd Owsnicki. Data models in knowledge representation systems: A case study. In C.-R. Rollinger and W. Horn, editors, GWAI-86 und 2. Osterreichische Artificial-Intelligence-Tagung, pages 69--74. Springer-Verlag, Berlin, West Germany, 1986.


An Empirical Analysis of Optimization Techniques.. - Baader.. (1994)   (59 citations)  (Correct)

....[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 subsumption problem [24; 31; 39; 35; 33; 40; 11; 12] As a result ....

J. Edelmann and B. Owsnicki. Data models in knowledge representation systems: A case study. In C.-R. Rollinger and W. Horn, editors, GWAI-86 und 2. Osterreichische Artificial-Intelligence-Tagung, pages 69--74, Ottenstein, Austria, Sept. 1986. Springer-Verlag.


Terminological Reasoning is Inherently Intractable - Nebel (1990)   (103 citations)  (Correct)

....without falling off the computational cliff. Some approaches aimed towards identifying restricted concept description languages that permit tractable subsumption determination of concept descriptions, exercised, for example, in the terminological subcomponents of kandor [23] krypton [4] meson [8], and recently classic [1, 2] Another interesting approach, pursued by Patel Schneider [22] employs a weaker semantics to achieve tractability of subsumption determination of concept descriptions for quite expressive concept description languages. All of these efforts tried to achieve the goal ....

J. Edelmann and B. Owsnicki, Data models in knowledge representation systems: a case study, in: C. Rollinger and W. Horn, eds., GWAI-86 und Terminological Reasoning 14 2. Osterreichische Artificial-Intelligence-Tagung, (Springer-Verlag, Berlin, West Germany, 1986) 69--74.


Hybrid Reasoning in BACK - Nebel, von Luck (1988)   (15 citations)  (Correct)

....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 present ....

Jurgen Edelmann and Bernd Owsnicki, "Data Models in Knowledge Representation Systems: A Case Study," in: C.-R. Rollinger, W. Horn (eds.), GWAI-86 und 2. Osterreichische Artificial-IntelligenceTagung, Berlin: Springer, 1986, pp. 69--74.


Terminological Logics with Modal Operators - Baader, Laux (1994)   (32 citations)  (Correct)

.... 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 world by listing the facts that hold in this part of the ....

J. Edelmann and B. Owsnicki. Data models in knowledge representation systems: A case study. In C. R. Rollinger and W. Horn, editors, GWAI 86, pages 69--74. Springer, 1986.


Algebraic Terminological Representation - Schmidt (1991)   (Correct)

....that combines a terminological representation formalism with an assertional representation formalism, was adopted in a host of so called hybrid knowledge representation systems. These include krypton (Brachman et al. [1983, 1985] kltwo (Vilain [1985] kandor (Patel Schneider [1984] meson (Edelmann and Owsnicki [1986]) and back (Nebel and von Luck [1988] Nebel and von Luck [1988] define a hybrid knowledge representation formalism to consist of two or more different subformalisms for representing different kinds of knowledge or knowledge in different kinds of representation formalisms. The terminological ....

Edelmann, J., and Owsnicki, B. [1986]. Data Models in Knowledge Representation Systems: A Case Study. 10th German Workshop on Artificial Intelligence, 69--74.


Managing Complex Objects in Peirce - Ellis, Levinson, Robinson (1994)   (3 citations)  (Correct)

....classification into hierarchies. KL ONE (Brachman Schmolze, 1985) is an early terminological reasoning system based on the design in Brachman (1977) Many knowledge representation systems have been built based on the ideas in KL ONE: KANDOR (Patel Schneider, 1984) KL TWO (Vilain, 1985) MESON (Edelmann Owsnicki, 1986), YAK (Cattoni Franconi, 1990) BACK (Peltason, 1991) CLASSIC (Patel Schneider, McGuinness, Brachman, Alperin Resnick, Borgida, 1991) K Rep (Mays, Dionne, Weida, 1991) KRYPTON (Brachman, Pigman Gilbert Levesque, 1985) KRIS (Baader Hollunder, 1991) LOOM (MacGregor, 1991) NIKL ....

EDELMANN, J. & OWSNICKI, B. (1986). Data Models in Knowledge Representation Systems: A Case Study. In C.-R. ROLLINGER & W. HORN, Eds. GWAI-86 und 2.


What is Hybrid in Hybrid Representation and Reasoning Systems? - Nebel (1989)   (Correct)

....and Reasoning Systems There are a number of examples of hybrid KRR systems described in the literature. First, there is a group of logic based hybrid systems, for instance, the cake system [52] the family of TBox ABox systems (e.g. kl two [60] krypton [9] kandor [48] back [61] meson [14], loom [29] and classic [6] theorem provers using sorted deduction [10, 17] or theory resolution [58] and constraint logic programming [22] Second, we have a group of hybrid systems which integrate logic with other formalisms [16, 51] In the following, we will concentrate on the former ....

....Formal Terminologies The TBox serves as the component which supports the representation of terminologies. In the following, a simple terminological language, called STL, will be introduced. 2 2 This is essentially the terminological language employed in the hybrid representation system MESON [14]. Terminologies are composed out of terminological axioms (TA) which relate a concept (the left hand side) to a concept description (the right hand side) TA A : C specialization j A : C equivalence: with the additional restriction that no concept may occur more than once as a left ....

J. Edelmann and B. Owsnicki. Data models in knowledge representation systems: a case study. In C. Rollinger and W. Horn, editors, GWAI86 und 2. Osterreichische Artificial-IntelligenceTagung, pages 69--74, Springer-Verlag, Berlin, West Germany, 1986.


A Scheme for Integrating Concrete Domains into Concept Languages - Baader, Hanschke (1991)   (120 citations)  (Correct)

.... first developed for the purpose of natural language processing [ Brachman et al. 1979 ] and some of the existing systems are still mostly used in this context (see 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 ....

.... kl one system [ Brachman and Schmolze, 1985 ] to full first order predicate logic as used in krypton [ Brachman et al. 1985 ] We shall now show how to integrate a concrete domain into an assertional language which is similar to the ones used in kandor [ Patel Schneider, 1984 ] meson [ Edelmann and Owsnicki, 1986 ] classic [ Borgida et al. 1989 ] or back [ Nebel and von Luck, 1988 ] 4.1 Syntax and Semantics Let D be an arbitrary concrete domain. We have seen in Section 3 that we have to deal with two different kinds of objects: the individuals of the concrete domain and the individuals in the ....

J. Edelmann and B. Owsnicki. Data models in knowledge representation systems: a case study. In GWAI-86 und 2. Ostereichische Artificial-IntelligenceTagung, volume 124 of Informatik-Fachberichte, pages 69--74. Springer, 1986.


Issues of Integration and Balancing in Hybrid Knowledge.. - Nebel, von Luck (1987)   (3 citations)  (Correct)

.... connection of KL ONE [Brachman, Schmolze 85] 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 [Brachman et al. 85] KL TWO [Vilain 85] MESON [Edelmann, Owsnicki 86] BACK [Luck et al. 87] and KANDOR [Patel Schneider 84] The main points in this research were the design of an appropriate ABox, sometimes requiring a restriction of the TBox (e.g. in KRYPTON) and developing means for connecting the reasoning of TBox and ABox. In the sequel we will present one ....

Jurgen Edelmann, Bernd Owsnicki, Data Models in Knowledge Representation Systems: A Case Study, in: C.-R. Rollinger, W. Horn (eds.), GWAI-86 und 2. Osterreichische Artificial-Intelligence-Tagung, Springer, Berlin (Germany), 1986, 69--74.


Computational Complexity of Terminological Reasoning in BACK - Nebel (1988)   (59 citations)  (Correct)

.... is (exactly) a human with at least one offspring a father is (exactly) a parent and a man a grandparent is (exactly) a human with at least one offspring which is a parent Although there is a broad diversity of FDLs in different hybrid systems (e.g. KL TWO [21] KRYPTON [5] KANDOR [16] MESON [7]) they are nevertheless very similar to each other. Despite superficial differences in the concrete syntax it is easy to identify the principal concept forming operators. One important characteristic of these languages is that they take the notion of definition seriously 4 . This means that ....

Edelmann, J. and Owsnicki, B., Data Models in Knowledge Representation Systems: A Case Study, in: Rollinger, C.-R. and Horn W. (Eds.), GWAI-86 und 2. Osterreichische Artificial-Intelligence-Tagung (Springer, Berlin, F.R.G., 1986) 69--74.


Description Logics with Concrete Domains - A Survey - Lutz (2003)   (8 citations)  (Correct)

No context found.

J. Edelmann and B. Owsnicki. Data models in knowledge representation systems: A case study. In Proceedings of the Tenth German Workshop on Arti cial Intelligence (GWAI'86) and the Second Austrian Symposium on Arti cial Intelligence (  OGAI'86), vol. 124 of Informatik-Fachberichte, pages 69-74. Springer Verlag, 1986.


An Empirical Analysis of Optimization Techniques.. - Baader.. (1992)   (59 citations)  (Correct)

No context found.

Jurgen Edelmann and Bernd Owsnicki (1986). Data models in knowledge representation systems: A case study. In Claus-Rainer Rollinger and Werner Horn, editors, GWAI-86 und 2. Osterreichische ArtificialIntelligence -Tagung, pages 69--74, Ottenstein, Austria.


Description Logics are not just for the Flightless-Birds: A New.. - Borgida (1992)   (6 citations)  (Correct)

No context found.

Edelman, J., and Owsnicki, B., "Data models in Knowledge Representation Systems: A case study", GWAI-86 und 2. Ostereichische Artificial IntelligenceTagung, pp.69--74, Springer Verlag (Informatik-Fachberichte), 1986

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