Towards an efficient algorithm to reason over description logics extended with nominal schemas

8Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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 scriptEscriptLscriptRscriptOscriptV n, a fragment that extends scriptEscriptL++ with nominal schemas. We also report on an implementation and experimental evaluation of the algorithm, which shows that our approach is indeed rather efficient. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Carral, D., Wang, C., & Hitzler, P. (2013). Towards an efficient algorithm to reason over description logics extended with nominal schemas. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7994 LNCS, pp. 65–79). https://doi.org/10.1007/978-3-642-39666-3_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free