Exploring finite models in the Description Logic EL_gfp

From International Center for Computational Logic
Toggle side column

Exploring finite models in the Description Logic EL_gfp

Franz BaaderFranz Baader,  Felix DistelFelix Distel
Franz Baader, Felix Distel
Exploring finite models in the Description Logic EL_gfp
Technical Report, Institute for Theoretical Computer Science, TU Dresden, volume 08-05, 2008. LTCS-Report
  • 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.
  • Bemerkung: Note: See http://lat.inf.tu-dresden.de/research/reports.html.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@techreport{ BaaDi08,
  address = {Dresden},
  author = {Franz {Baader} and Felix {Distel}},
  institution = {Institute for Theoretical Computer Science, TU Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {08-05},
  title = {Exploring finite models in the Description Logic {$\mathcal{EL}_\mathrm{gfp}$}},
  type = {LTCS-Report},
  year = {2008},
}