Abstract
This paper is the successor to two previous papers published at the ICFCA conference. In the first 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. An exploration formalism that can be used to obtain this basis was presented in the second paper. In this paper we show how this formalism can be modified such that counterexamples to GCIs can be provided in the form of ABox-individuals. In a second part of the paper we examine which description logics can be used for this ABox. © Springer-Verlag Berlin Heidelberg 2010.
Cite
CITATION STYLE
Distel, F. (2010). An approach to exploring description logic knowledge bases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5986 LNAI, pp. 209–224). https://doi.org/10.1007/978-3-642-11928-6_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
