Applying Formal Concept Analysis to Description Logics

Franz BaaderFranz Baader, B. SertkayaB. Sertkaya

Download

Franz Baader, B. Sertkaya
Applying Formal Concept Analysis to Description Logics
In P. Eklund, eds., Proceedings of the 2nd International Conference on Formal Concept Analysis (ICFCA 2004), volume 2961 of Lecture Notes in Artificial Intelligence, 261-286, 2004. Springer

Details
Bibtex

KurzfassungAbstract
Given a finite set S := {C1, ..., Cn} of description logic concepts, we are interested in computing the subsumption hierarchy of all least common subsumers of subsets of S as well as the hierarchy of all conjunctions of subsets of S. 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 S, 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.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

The final publication is available at Springer.

@inproceedings{ BaaderSertkayaICFCA04,
  author = {F. {Baader} and B. {Sertkaya}},
  booktitle = {Proceedings of the 2nd International Conference on Formal Concept Analysis ({ICFCA 2004})},
  editor = {P. {Eklund}},
  pages = {261--286},
  publisher = {Springer},
  series = {Lecture Notes in Artificial Intelligence},
  title = {Applying Formal Concept Analysis to Description Logics},
  volume = {2961},
  year = {2004},
}