<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Cong Wang</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards an Efficient Algorithm to Reason over Description Logics Extended with Nominal Schemas</style></title><secondary-title><style face="normal" font="default" size="100%">Web Reasoning and Rule Systems - 7th International Conference, {RR} 2013, Mannheim, Germany, July 27-29, 2013. Proceedings</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">description logics</style></keyword><keyword><style  face="normal" font="default" size="100%">EL++</style></keyword><keyword><style  face="normal" font="default" size="100%">Nominal Schemas</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-39666-3_6</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">65–79</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;
</style></abstract></record></records></xml>