Abstract
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.
This work is partially funded by Thailand Research Fund under grant MRG5380245 and the NRU project of Thailand Office for Higher Education Commission.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) envelope. In: Proceedings of the 19th International Conference on Artificial Intelligence (IJCAI 2005). Morgan-Kaufmann Publishers, Edinburgh (2005)
Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) envelope further. In: Clark, K., Patel-Schneider, P.F. (eds.) Proceedings of the OWLED 2008 DC Workshop on OWL: Experiences and Directions (2008)
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook: Theory, Implementation and Applications, 2nd edn. Cambridge University Press (2007)
Baader, F., Hollunder, B.: Embedding defaults into terminological knowledge representation formalisms. Journal of Automated Reasoning 14, 149–180 (1995)
Baader, F., Lutz, C., Suntisrivaraporn, B.: Is tractable reasoning in extensions of the Description Logic \(\mathcal{EL}\) useful in practice? Journal of Logic, Language and Information, Special Issue on Method for Modality, M4M (2007)
Baader, F., Peñaloza, R., Suntisrivaraporn, B.: Pinpointing in the Description Logic \(\mathcal{EL}^+\). In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNCS (LNAI), vol. 4667, pp. 52–67. Springer, Heidelberg (2007)
Ceusters, W., Smith, B., Kumar, A., Dhaen, C.: Snomed ct’s problem list: Ontologists’ and logicians’ therapy suggestions. In: Jack, Y.-C., Fieschi, L.M., Coiera, E. (eds.) Proceedings of the Medinfo 2007 Congress. Studies in Health Technology and Informatics (SHTI-series), pp. 482–491. IOS Press (2004)
Ge, J., Qiu, Y.: Concept similarity matching based on semantic distance. In: Proceedings of the Forth International Conference on Semantics, Knowledge and Grid, pp. 380–383. IEEE Computer Society (2008)
Motik, B., Cuenca Grau, B., Horrocks, I., Wu, Z., Fokoue, A., Lutz, C.: OWL 2 web ontology language profiles (2009), http://www.w3.org/TR/owl2-profiles/
Parsia, B., Sirin, E., Kalyanpur, A.: Debugging OWL ontologies. In: Proceedings of the 14th International Conference on WWW 2005, pp. 633–640. ACM (2005)
Schlobach, S., Cornet, R.: Non-standard reasoning services for the debugging of Description Logic terminologies. In: Gottlob, G., Walsh, T. (eds.) Proceedings of IJCAI 2003, Acapulco, Mexico, pp. 355–362. Morgan-Kaufmann Publishers (2003)
Stearns, M.Q., Price, C., Spackman, K.A., Wang, A.Y.: Snomed clinical terms: Overview of the development process and project status. In: Proceedings of the 2001 AMIA Annual Symposium, pp. 662–666. Hanley&Belfus (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suntisrivaraporn, B. (2011). Structural Distance between \(\mathcal{EL}^{+}\) Concepts. In: Sombattheera, C., Agarwal, A., Udgata, S.K., Lavangnananda, K. (eds) Multi-disciplinary Trends in Artificial Intelligence. MIWAI 2011. Lecture Notes in Computer Science(), vol 7080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25725-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-25725-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25724-7
Online ISBN: 978-3-642-25725-4
eBook Packages: Computer ScienceComputer Science (R0)