Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very expressive DLs. In order to allow the user to re-use concepts defined in such terminologies and still support the definition of new concepts by computing the lcs, we extend the notion of the lcs of concept descriptions to the notion of the lcs w.r.t. a background terminology. We will both show a theoretical result on the existence of the least common subsumer in this setting, and describe a practical approach (based on a method from formal concept analysis) for computing good common subsumers, which may, however, not be the least ones.
CITATION STYLE
Baader, F., Sertkaya, B., & Turhan, A. Y. (2004). Computing the least common subsumer w.r.t. a background terminology. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3229, pp. 400–412). Springer Verlag. https://doi.org/10.1007/978-3-540-30227-8_34
Mendeley helps you to discover research relevant for your work.