Elsevier

Journal of Applied Logic

Volume 5, Issue 3, September 2007, Pages 392-420
Journal of Applied Logic

Computing the least common subsumer w.r.t. a background terminology

https://doi.org/10.1016/j.jal.2006.03.002Get rights and content
Under an Elsevier user license
open archive

Abstract

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 show both theoretical results 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. We will also describe results obtained in a first evaluation of this practical approach.

Keywords

Description Logic
Non-standard inferences

Cited by (0)

This work was supported by the German Science Foundation (DFG) under the grants GRK 334/3 and BA 1122/4-4.