01105nas a2200169 4500008004100000245009900041210006900140300001200209520055900221653002300780653000900803653002000812100001800832700001500850700002000865856005000885 2013 eng d00aTowards an Efficient Algorithm to Reason over Description Logics Extended with Nominal Schemas0 aTowards an Efficient Algorithm to Reason over Description Logics a65–793 a

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 ELROVn, 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.

10adescription logics10aEL++10aNominal Schemas1 aCarral, David1 aWang, Cong1 aHitzler, Pascal uhttp://dx.doi.org/10.1007/978-3-642-39666-3_6