<?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%">Cristina Feier</style></author><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Giorgio Stefanoni</style></author><author><style face="normal" font="default" size="100%">Cuenca Grau, Bernardo</style></author><author><style face="normal" font="default" size="100%">Ian Horrocks</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The Combined Approach to Query Answering Beyond the OWL 2 Profiles</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.cs.ox.ac.uk/isg/people/cristina.feier/ijcai_rsafinal.pdf</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Combined approaches have become a successful technique for CQ answering over ontologies. Existing algorithms, however, are restricted to the logics underpinning the OWL 2 profiles. Our goal is to make combined approaches applicable to a wider range of ontologies. We focus on RSA: a class of Horn ontologies that extends the profiles while ensuring tractability of standard reasoning. We show that CQ answering over RSA ontologies without role composition is feasible in NP. Our reasoning procedure generalises the combined approach for ELHO and DL-LiteR using an encoding of CQ answering into fact entailment w.r.t. a logic program with function symbols and stratified negation. Our results have significant practical implications since many out-of-profile Horn ontologies are RSA.&lt;/p&gt;
</style></abstract></record><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%">Cristina Feier</style></author><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Giorgio Stefanoni</style></author><author><style face="normal" font="default" size="100%">Cuenca Grau, Bernardo</style></author><author><style face="normal" font="default" size="100%">Ian Horrocks</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Extending the Combined Approach Beyond Lightweight Description Logics</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 28th International Workshop on Description Logics (DL)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.cs.ox.ac.uk/isg/people/cristina.feier/pdfs/dlmain.pdf</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Combined approaches have become a successful technique for CQ answering over ontologies. Existing algorithms, however, are restricted to the logics underpinning the OWL 2 profiles. Our goal is to make combined approaches applicable to a wider range of ontologies. We focus on RSA: a class of Horn ontologies that extends the profiles while ensuring tractability of standard reasoning. We show that CQ answering over RSA ontologies without role composition is feasible in NP. Our reasoning procedure generalises the combined approach for ELHO and DL-LiteR using an encoding of CQ answering into fact entailment w.r.t. a logic program with function symbols and stratified negation. Our results are significant in practice since many out-of-profile Horn ontologies are RSA.&lt;/p&gt;
</style></abstract></record></records></xml>