Loading...
Please wait, while we are loading the content...
Similar Documents
Computing Least Common Subsumers in Expressive Description Logics (1999)
| Content Provider | CiteSeerX |
|---|---|
| Author | Mantay, Thomas |
| Abstract | Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service can be used for the approximation of concept disjunctions in description logics, for the \bottom-up" construction of knowledge bases, and for specic kinds of information retrieval. So far, computing the least common subsumer has been restricted to description logics with rather limited expressivity. In this article, we continue recent research on extending this operation to more complex languages and present a least common subsumer operator for the expressive description logics ALENR and ALQ. 1 Introduction Knowledge representation systems based on description logics have proven to be a useful means for representing the terminological knowledge of an application domain in a structured and formally well understood way [5]. In description logics, knowledge bases are formed out of concepts representing... |
| File Format | |
| Publisher Date | 1999-01-01 |
| Access Restriction | Open |
| Subject Keyword | Introduction Knowledge Representation System Least Common Subsumers Understood Way Limited Expressivity Bottom-up Construction Common Subsumer Least Common Subsumer Operator Application Domain Important Reasoning Service Complex Language Description Logic Terminological Knowledge Recent Research Concept Disjunction Knowledge Base Common Subsumers Expressive Description Logic Expressive Description Logic Alenr Information Retrieval Specic Kind Useful Mean |
| Content Type | Text |
