Exploring Finite Models in the Description Logic ELgfp

From International Center for Computational Logic

Toggle side column

Exploring Finite Models in the Description Logic ELgfp

Franz BaaderFranz Baader,  Felix DistelFelix Distel
Franz Baader, Felix Distel
Exploring Finite Models in the Description Logic ELgfp
In Sébastien Ferré and Sebastian Rudolph, eds., Proceedings of the 7th International Conference on Formal Concept Analysis, (ICFCA 2009), volume 5548 of Lecture Notes in Artificial Intelligence, 146-161, 2009. Springer
  • KurzfassungAbstract
    In a previous ICFCA paper we have shown that, in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a finite model always has a finite basis. In this paper, we address the problem of how to compute this basis efficiently, by adapting methods from formal concept analysis.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
The final publication is available at Springer.
@inproceedings{ BaDi09,
  author = {Franz {Baader} and Felix {Distel}},
  booktitle = {Proceedings of the 7th International Conference on {F}ormal {C}oncept {A}nalysis, {(ICFCA 2009)}},
  editor = {S\'ebastien {Ferr\'e} and Sebastian {Rudolph}},
  pages = {146--161},
  publisher = {Springer Verlag},
  series = {Lecture Notes in Artificial Intelligence},
  title = {Exploring Finite Models in the Description Logic {ELgfp}},
  volume = {5548},
  year = {2009},
}