Towards an Efficient Algorithm to Reason over Description Logics Extended with Nominal Schemas

Authors

David Carral
Cong Wang
Pascal HitzlerFollow

Document Type

Conference Proceeding

Publication Date

7-2013

Abstract

Extending description logics with so-called nominal schemas has been shown to be a major step towards integrating description logics with rules paradigms. However, establishing efficient algorithms for reasoning with nominal schemas has so far been a challenge. In this paper, we present an algorithm to reason with the description logic fragment ELROV_n, a fragment that extends EL⁺⁺ with nominal schemas. We also report on an implementation and experimental evaluation of the algorithm, which shows that our approach is indeed rather efficient.

Comments

Attached is the unpublished, peer-reviewed version of the proceeding. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-39666-3_6.

Presented at the 7th International Conference on the Web Reasoning and Rule Systems, Mannheim, Germany, July 27-29, 2013.

Additional file is an extended technical report containing an appendix.

Repository Citation

Carral, D., Wang, C., & Hitzler, P. (2013). Towards an Efficient Algorithm to Reason over Description Logics Extended with Nominal Schemas. Lecture Notes in Computer Science, 7994, 65-79.
https://corescholar.libraries.wright.edu/cse/178

DOI

10.1007/978-3-642-39666-3_6