# Exploring finite models in the Description Logic EL_gfp

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: Automatentheorie
@techreport{ BaaDi08,
title = {Exploring finite models in the Description Logic {$\mathcal{EL}_\mathrm{gfp}$}},