Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Exploring Finite Models in the Description Logic ${\mathcal {EL}}_{\rm gfp}$
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Completing description logic knowledge bases using formal concept analysis
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Terminological cycles in a description logic with existential restrictions
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A finite basis for the set of ƐL-implications holding in a finite model
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
CEL: a polynomial-time reasoner for life science ontologies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
What's happening in semantic web: and what FCA could have to do with it
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
| Hi-index | 0.00 |
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 $\mathcal{EL}$ and $\mathcal{EL}_{\rm gfp}$, 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.