Applying Formal Concept Analysis to Description Logics

摘要: Given a finite set \(\mathcal{C} := \{ C_1, \ldots, C_n\}\) of description logic concepts, we are interested in computing the subsumption hierarchy all least common subsumers subsets \(\mathcal{C}\) as well conjunctions \(\mathcal{C}\). These hierarchies can be used to support bottom-up construction knowledge bases. The point is compute first without having subsumer for \(\mathcal{C}\), and second check possible pairs such explicitly subsumption. We will show that methods from formal concept analysis developed lattices employed this purpose.