Exploring finite models in the Description Logic ELgfp
Institut für Theoretische Informatik TU Dresden, Franz Baader, Felix Distel, Institut für Theoretische Informatik TU Dresden · 2008
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.