Skip to main content

Computing Role-Depth Bounded Generalizations in the Description Logic \(\mathcal{ELOR}\)

  • Conference paper
KI 2013: Advances in Artificial Intelligence (KI 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8077))

Included in the following conference series:

Abstract

Description Logics (DLs) are a family of knowledge representation formalisms, that provides the theoretical basis for the standard web ontology language OWL. Generalization services like the least common subsumer (lcs) and the most specific concept (msc) are the basis of several ontology design methods, and form the core of similarity measures. For the DL \(\mathcal{ELOR}\), which covers most of the OWL 2 EL profile, the lcs and msc need not exist in general, but they always exist if restricted to a given role-depth. We present algorithms that compute these role-depth bounded generalizations. Our method is easy to implement, as it is based on the polynomial-time completion algorithm for \(\mathcal{ELOR}.\)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baader, F.: Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles. In: Gottlob, G., Walsh, T. (eds.) Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003), pp. 325–330. Morgan Kaufmann (2003)

    Google Scholar 

  2. Baader, F.: Terminological cycles in a description logic with existential restrictions. In: Gottlob, G., Walsh, T. (eds.) Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003), pp. 319–324. Morgan Kaufmann (2003)

    Google Scholar 

  3. Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) envelope. In: Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2005), Edinburgh, UK. Morgan-Kaufmann Publishers (2005)

    Google Scholar 

  4. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press (2003)

    Google Scholar 

  5. Baader, F., Küsters, R., Molitor, R.: Computing least common subsumers in description logics with existential restrictions. In: Dean, T. (ed.) Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI 1999), Stockholm, Sweden, pp. 96–101. Morgan Kaufmann, Los Altos (1999)

    Google Scholar 

  6. Borgida, A., Walsh, T., Hirsh, H.: Towards measuring similarity in description logics. In: Proc. of the 2005 Description Logic Workshop (DL 2005). CEUR Workshop Proceedings, vol. 147 (2005)

    Google Scholar 

  7. Brandt, S., Turhan, A.-Y.: Using non-standard inferences in description logics — what does it buy me? In: Görz, G., Haarslev, V., Lutz, C., Möller, R. (eds.) Proc. of the 2001 Applications of Description Logic Workshop (ADL 2001), Vienna, Austria. CEUR Workshop, vol. (44). RWTH Aachen (September 2001), http://CEUR-WS.org/Vol-44/

  8. d’Amato, C., Fanizzi, N., Esposito, F.: A semantic similarity measure for expressive description logics. In: Proc. of Convegno Italiano di Logica Computazionale (CILC 2005) (2005)

    Google Scholar 

  9. Ecke, A., Peñaloza, R., Turhan, A.-Y.: Towards instance query answering for concepts relaxed by similarity measures. In: Workshop on Weighted Logics for AI (in conjunction with IJCAI 2013), Beijing, China (to appear, 2013)

    Google Scholar 

  10. Ecke, A., Turhan, A.-Y.: Role-depth bounded least common subsumers for \(\mathcal{EL}^+\) and \(\mathcal{ELI}\). In: Kazakov, Y., Lembo, D., Wolter, F. (eds.) Proc. of the 2012 Description Logic Workshop (DL 2012). CEUR Workshop Proceedings, vol. 846. CEUR-WS.org (2012)

    Google Scholar 

  11. Kazakov, Y., Krötzsch, M., Simančík, F.: ELK reasoner: Architecture and evaluation. In: Horrocks, I., Yatskevich, M., Jimenez-Ruiz, E. (eds.) Proceedings of the OWL Reasoner Evaluation Workshop (ORE 2012). CEUR Workshop Proceedings, vol. 858. CEUR-WS.org (2012)

    Google Scholar 

  12. Kazakov, Y., Krötzsch, M., Simančík, F.: Practical reasoning with nominals in the \(\mathcal{EL}\) family of description logics. In: Brewka, G., Eiter, T., McIlraith, S.A. (eds.) Proc. of the 12th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2012), pp. 264–274. AAAI Press (2012)

    Google Scholar 

  13. Küsters, R., Molitor, R.: Approximating most specifc concepts in description logics with existential restrictions. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol. 2174, pp. 33–47. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Lehmann, K., Turhan, A.-Y.: A framework for semantic-based similarity measures for \(\mathcal{ELH}\)-concepts. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS, vol. 7519, pp. 307–319. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  15. Mendez, J.: jCel: A modular rule-based reasoner. In: Proc. of the 1st Int. Workshop on OWL Reasoner Evaluation (ORE 2012). CEUR, vol. 858 (2012)

    Google Scholar 

  16. Motik, B., Cuenca Grau, B., Horrocks, I., Wu, Z., Fokoue, A., Lutz, C.: OWL 2 web ontology language profiles. W3C Recommendation (October 27, 2009), http://www.w3.org/TR/2009/REC-owl2-profiles-20091027/

  17. Peñaloza, R., Turhan, A.-Y.: A practical approach for computing generalization inferences in \({\mathcal{EL}}\). In: Antoniou, G., Grobelnik, M., Simperl, E., Parsia, B., Plexousakis, D., De Leenheer, P., Pan, J. (eds.) ESWC 2011, Part I. LNCS, vol. 6643, pp. 410–423. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  18. Peñaloza, R., Turhan, A.-Y.: Instance-based non-standard inferences in \(\mathcal{EL}\) with subjective probabilities. In: Bobillo, F., Costa, P.C.G., d’Amato, C., Fanizzi, N., Laskey, K.B., Laskey, K.J., Lukasiewicz, T., Nickles, M., Pool, M. (eds.) URSW 2008-2010/UniDL 2010. LNCS, vol. 7123, pp. 80–98. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  19. Rosse, C., Mejino, J.L.V.: A reference ontology for biomedical informatics: the foundational model of anatomy. Journal of Biomedical Informatics 36, 478–500 (2003)

    Article  Google Scholar 

  20. Spackman, K.: Managing clinical terminology hierarchies using algorithmic calculation of subsumption: Experience with SNOMED-RT. Journal of the American Medical Informatics Assoc. (2000) (Fall Symposium Special Issue)

    Google Scholar 

  21. Turhan, A.-Y., Zarrieß, B.: Computing the lcs w.r.t. general \(\mathcal{EL}+\) TBoxes. In: Proceedings of the 26th International Workshop on Description Logics (DL 2013), Ulm, Germany, CEUR Workshop Proceedings. CEUR-WS.org. (to appear, July 2013)

    Google Scholar 

  22. W3C OWL Working Group. OWL 2 web ontology language document overview. W3C Recommendation (October 27, 2009), http://www.w3.org/TR/2009/REC-owl2-overview-20091027/ .

  23. Zarrieß, B., Turhan, A.-Y.: Most specific generalizations w.r.t. general \(\mathcal{EL}\)-TBoxes. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), Beijing, China. AAAI Press (to appear, 2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ecke, A., Peñaloza, R., Turhan, AY. (2013). Computing Role-Depth Bounded Generalizations in the Description Logic \(\mathcal{ELOR}\) . In: Timm, I.J., Thimm, M. (eds) KI 2013: Advances in Artificial Intelligence. KI 2013. Lecture Notes in Computer Science(), vol 8077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40942-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40942-4_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40941-7

  • Online ISBN: 978-3-642-40942-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics