Virtual OBDA over Expressive Ontologies: Rewritings and Approximations

In this paper we extend virtual OBDA to more expressive ontology languages than that of DL-LiteR, which is the logic underpinning the W3C ontology language OWL 2. We achieve this by relying on two well-known mechanisms, namely conservative rewriting and approximation, and compiling some of the domain semantics into OBDA mappings.

[1]  Li Ma,et al.  Towards a Complete OWL Ontology Benchmark , 2006, ESWC.

[2]  Diego Calvanese,et al.  Ontologies and Databases: The DL-Lite Approach , 2009, Reasoning Web.

[3]  Carsten Lutz,et al.  Conservative Extensions in Expressive Description Logics , 2007, IJCAI.

[4]  Peter Haase,et al.  Optique: Zooming in on Big Data , 2015, Computer.

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

[6]  Michael Zakharyaschev,et al.  Ontology-Based Data Access: Ontop of Databases , 2013, SEMWEB.

[7]  Jeff Z. Pan,et al.  Soundness Preserving Approximation for TBox Reasoning , 2010, AAAI.

[8]  Diego Calvanese,et al.  Beyond OWL 2 QL in OBDA: Rewritings and Approximations , 2015, AAAI.

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

[10]  Jeff Z. Pan,et al.  Approximating OWL-DL Ontologies , 2007, AAAI.

[11]  Maurizio Lenzerini,et al.  Optimizing query rewriting in ontology-based data access , 2013, EDBT '13.

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

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

[14]  Haim Gaifman,et al.  Decidable optimization problems for database logic programs , 1988, STOC '88.

[15]  Boris Motik,et al.  Computing Datalog Rewritings Beyond Horn Ontologies , 2013, IJCAI.

[16]  Riccardo Rosati,et al.  Query-based comparison of OBDA specifications , 2015, Description Logics.

[17]  Michael Zakharyaschev,et al.  Answering SPARQL Queries over Databases under OWL 2 QL Entailment Regime , 2014, SEMWEB.

[18]  Diego Calvanese,et al.  Data Complexity of Query Answering in Description Logics , 2006, Description Logics.

[19]  Yevgeny Kazakov,et al.  Consequence-Driven Reasoning for Horn SHIQ Ontologies , 2009, IJCAI.

[20]  Ondřej Klobušník,et al.  ArXiv.org e-print archive , 2004 .

[21]  Riccardo Rosati,et al.  Effective Computation of Maximal Sound Approximations of Description Logic Ontologies , 2014, International Semantic Web Conference.

[22]  Boris Motik,et al.  Data Complexity of Reasoning in Very Expressive Description Logics , 2005, IJCAI.

[23]  Harry G. Mairson,et al.  Undecidable optimization problems for database logic programs , 1993, JACM.

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

[25]  Frank Wolter,et al.  Query Inseparability for Description Logic Knowledge Bases , 2014, KR.

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

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

[28]  Robert Piro,et al.  Description Logic TBoxes: Model-Theoretic Characterizations and Rewritability , 2011, IJCAI.