@inproceedings{baader2004applying,
abstract = {Given a finite set $\mathcal{C} := \{ 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 $\mathcal{C}$ as well as the hierarchy of all conjunctions of subsets of $\mathcal{C}$. These hierarchies can be used to support the bottom-up 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 $\mathcal{C}$, 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.},
address = {Berlin/Heidelberg},
author = {Baader, Franz and Sertkaya, Baris},
booktitle = {Concept Lattices},
doi = {10.1007/978-3-540-24651-0_24},
editor = {Eklund, Peter W.},
interhash = {bf9599a95577070ddd4097d63d4b6cb8},
intrahash = {a61b258d2724c3cb17f5dfdd6db185cb},
isbn = {3-540-21043-1},
pages = {261--286},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
title = {Applying Formal Concept Analysis to Description Logics.},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2961&spage=261},
volume = 2961,
year = 2004
}