WWW '05 Proceedings of the 14th international conference on World Wide Web
The Description Logic Handbook
The Description Logic Handbook
Pinpointing in the Description Logic $\mathcal {EL}^+$
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
Concept Similarity Matching Based on Semantic Distance
SKG '08 Proceedings of the 2008 Fourth International Conference on Semantics, Knowledge and Grid
Non-standard reasoning services for the debugging of description logic terminologies
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
| Hi-index | 0.00 |
The inexpressive Description Logics in the $\mathcal{EL}$ family have been successful mainly due to their tractability of standard reasoning tasks like subsumption, adoption in modeling of biomedical ontologies, and standardization as an OWL 2 EL profile. This paper proposes two enhanced subsumption algorithms that not only test whether a particular subsumption holds but also give a numeric indicator showing the structural distance between the two concepts in the subsumption relationship. Structural distance is defined in terms of the effort required to obtain the subsumption in question. Both algorithms extend the standard subsumption algorithm for $\mathcal{EL}^{+}$ by an axiom labeling technique, originally proposed for finding justifications.