@book{baader2003description,
  address = {New York, NY, USA},
  editor = {Baader, Franz and Calvanese, Diego and McGuinness, Deborah L. and Nardi, Daniele and Patel-Schneider, Peter F.},
  interhash = {2f372868d92592682a7f7dadae8761e7},
  intrahash = {3f3eae59671cd44a37e32b548f8464c5},
  isbn = {0-521-78176-0},
  publisher = {Cambridge University Press},
  title = {The description logic handbook: theory, implementation, and applications},
  year = 2003
}

@inproceedings{baader2007completing,
  abstract = {We propose an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using information provided by the knowledge base and by a domain expert. The use of techniques from Formal Concept Analysis ensures that, on the one hand, the interaction with the expert is kept to a minimum, and, on the other hand, we can show that the extended knowledge base is complete in a certain, well-defined sense.},
  acmid = {1625311},
  address = {San Francisco, CA, USA},
  author = {Baader, Franz and Ganter, Bernhard and Sertkaya, Baris and Sattler, Ulrike},
  booktitle = {Proceedings of the 20th international joint conference on Artifical intelligence},
  interhash = {8ab382f3aa141674412ba7ad33316a9b},
  intrahash = {87f98ae486014ba78690ffa314b67da8},
  location = {Hyderabad, India},
  numpages = {6},
  pages = {230--235},
  publisher = {Morgan Kaufmann Publishers Inc.},
  title = {Completing description logic knowledge bases using formal concept analysis},
  url = {http://dl.acm.org/citation.cfm?id=1625275.1625311},
  year = 2007
}

@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
}