Computing Least Common Subsumers in Expressive Description Logics

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 speci c kinds of information retrieval. So far, the least common subsumer operator has been restricted to description logics which do not contain both existential restrictions and number restrictions. In this article, we present a least common subsumer operator for the expressive description logics ALENR and ALEQ which both include these operators.

• Type: Conference
• Year: 1999
• Where: AUSAI
• Authors: Thomas Mantay
• Keywords: Artificial Intelligence, AUSAI 1999, Common Subsumer, Common Subsumer Operator, Description Logics