Building and structuring description logic knowledge bases using least common subsumers and concept analysis

摘要

Given a finite set C := {C1,. . ., C{sub}n} of description logic concepts, we are interested in computing the subsumption hierarchy of all least common subsumers of subsets of C. This hierarchy can be used to support the bottom-up construction and the structuring of description logic knowledge bases. The point is to compute this hierarchy without having to compute the least common subsumer for all subsets of C. We will show that methods from formal concept analysis developed for computing concept lattices can be employed for this purpose.