Computing least common subsumers in expressive description logics

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 reeisoning service can be used for the approximation of concept disjunctions in description logics, the “bottom-up” construction of knowledge bases, learning tasks, and for specific kinds of information retrieval. So fax, computing the least common subsumer has been restricted to description logics with rather Umited 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 logic ALENR.