Exploring Finite Models in the Description Logic

Abstract. 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.

• Type: Conference
• Year: 2009
• Where: ICFCA
• Authors: Franz Baader, Felix Distel
• Keywords: Formal Concept Analysis, Formal Languages, General Concept Inclusions, ICFCA 2009, finite Basis