Computing FO-Rewritings in EL in Practice: from Atomic to Conjunctive Queries

A prominent approach to implementing ontology-mediated queries (OMQs) is to rewrite into a first-order query, which is then executed using a conventional SQL database system. We consider the case where the ontology is formulated in the description logic \(\mathcal{EL}\) and the actual query is a conjunctive query and show that rewritings of such OMQs can be efficiently computed in practice, in a sound and complete way. Our approach combines a reduction with a decomposed backwards chaining algorithm for OMQs that are based on the simpler atomic queries, also illuminating the relationship between first-order rewritings of OMQs based on conjunctive and on atomic queries. Experiments with real-world ontologies show promising results.

[1]  Pablo Barceló,et al.  Containment for Rule-Based Ontology-Mediated Queries , 2017, PODS.

[2]  Boris Motik,et al.  Answering Conjunctive Queries over EL Knowledge Bases with Transitive and Reflexive Roles , 2014, AAAI.

[3]  Giorgos Stoilos,et al.  Optimising Resolution-Based Rewriting Algorithms for DL Ontologies , 2013, Description Logics.

[4]  Diego Calvanese,et al.  Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[5]  Carsten Lutz,et al.  Non-Uniform Data Complexity of Query Answering in Description Logics , 2012, Description Logics.

[6]  Boris Motik,et al.  Small Datalog Query Rewritings for EL , 2012, Description Logics.

[7]  Alin Deutsch,et al.  Physical Data Independence, Constraints, and Optimization with Universal Plans , 1999, VLDB.

[8]  Carsten Lutz,et al.  Two Upper Bounds for Conjunctive Query Answering in SHIQ , 2008, Description Logics.

[9]  Pablo Barceló,et al.  The complexity of reverse engineering problems for conjunctive queries , 2016, ICDT.

[10]  Carsten Lutz,et al.  First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics , 2016, Description Logics.

[11]  Thomas Schwentick,et al.  The price of query rewriting in ontology-based data access , 2014, Artif. Intell..

[12]  Marie-Laure Mugnier,et al.  Query Rewriting for Existential Rules with Compiled Preorder , 2015, IJCAI.

[13]  Bernardo Cuenca Grau,et al.  OWL 2 Web Ontology Language: Profiles , 2009 .

[14]  Carsten Lutz,et al.  Conjunctive Query Answering in the Description Logic EL Using a Relational Database System , 2009, IJCAI.

[15]  Diego Calvanese,et al.  The DL-Lite Family and Relations , 2009, J. Artif. Intell. Res..

[16]  Stanislav Kikot,et al.  Conjunctive Query Answering with OWL 2 QL , 2012, KR.

[17]  Carsten Lutz,et al.  Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk) , 2017, ICDT.

[18]  Thomas Eiter,et al.  Query Rewriting for Horn-SHIQ Plus Rules , 2012, AAAI.

[19]  Daniele Nardi,et al.  An Introduction to Description Logics , 2003, Description Logic Handbook.

[20]  Riccardo Rosati,et al.  Improving Query Answering over DL-Lite Ontologies , 2010, KR.

[21]  Boris Motik,et al.  Tractable query answering and rewriting under description logic constraints , 2010, J. Appl. Log..

[22]  Michaël Thomazo,et al.  Sound, Complete, and Minimal Query Rewriting for Existential Rules , 2013, IJCAI.

[23]  Carsten Lutz,et al.  The Complexity of Conjunctive Query Answering in Expressive Description Logics , 2008, IJCAR.

[24]  Diego Calvanese,et al.  High Performance Query Answering over DL-Lite Ontologies , 2012, KR.

[25]  D. Nardi,et al.  An Introduction to Description Logic , 2017 .

[26]  Carsten Lutz,et al.  First-Order Rewritability of Atomic Queries in Horn Description Logics , 2013, IJCAI.

[27]  Carsten Lutz,et al.  Efficient Query Rewriting in the Description Logic EL and Beyond , 2015, IJCAI.