Applying Formal Concept Analysis to Description Lo

Authors: Franz Baader Baris Sertkaya

Publish Date: 2004/2/23

Volume: , Issue: , Pages: 261-286

PDF Link

Abstract

Given a finite set mathcalC = C 1 ldots C n of description logic concepts we are interested in computing the subsumption hierarchy of all least common subsumers of subsets of mathcalC as well as the hierarchy of all conjunctions of subsets of mathcalC These hierarchies can be used to support the bottomup construction of description logic knowledge bases The point is to compute the first hierarchy without having to compute the least common subsumer for all subsets of mathcalC and the second hierarchy without having to check all possible pairs of such conjunctions explicitly for subsumption We will show that methods from formal concept analysis developed for computing concept lattices can be employed for this purpose

Keywords: