Games for query inseparability of description logic knowledge bases

We consider conjunctive query inseparability of description logic knowledge bases with respect to a given signature-a fundamental problem in knowledge base versioning, module extraction, forgetting and knowledge exchange. We give a uniform game-theoretic characterisation of knowledge base conjunctive query inseparability and develop worst-case optimal decision algorithms for fragments of Horn- ALCHI , including the description logics underpinning OWL?2?QL and OWL?2?EL. We also determine the data and combined complexity of deciding query inseparability. While query inseparability for all of these logics is P-complete for data complexity, the combined complexity ranges from P- to ExpTime- to 2ExpTime-completeness. We use these results to resolve two major open problems for OWL?2?QL by showing that TBox query inseparability and the membership problem for universal conjunctive query solutions in knowledge exchange are both ExpTime-complete for combined complexity. Finally, we introduce a more flexible notion of inseparability which compares answers to conjunctive queries in a given signature over a given set of individuals. In this case, checking query inseparability becomes NP-complete for data complexity, but the ExpTime- and 2ExpTime-completeness combined complexity results are preserved.

[1]  Riccardo Rosati,et al.  On Conjunctive Query Answering in EL , 2007, Description Logics.

[2]  Sebastian Rudolph,et al.  Complexities of Horn Description Logics , 2013, TOCL.

[3]  Boris Konev,et al.  Forgetting and Uniform Interpolation in Large-Scale Description Logic Terminologies , 2009, IJCAI.

[4]  Katarina Britz,et al.  Reachability modules for the Description Logic SRIQ , 2013 .

[5]  Birte Glimm,et al.  Hitting the Sweetspot: Economic Rewriting of Knowledge Bases , 2012, SEMWEB.

[6]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[7]  Carsten Lutz,et al.  Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics , 2011, IJCAI.

[8]  Carsten Lutz,et al.  Schema.org as a Description Logic , 2015, Description Logics.

[9]  Peter F. Patel-Schneider,et al.  Analyzing Schema.org , 2014, SEMWEB.

[10]  Carsten Lutz,et al.  Deciding inseparability and conservative extensions in the description logic EL , 2010, J. Symb. Comput..

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

[12]  K. Chatterjee,et al.  An O(n^2) Time Algorithm for Alternating B\"uchi Games , 2011 .

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

[14]  Diego Calvanese,et al.  Exchanging Description Logic Knowledge Bases , 2012, KR.

[15]  Carsten Lutz,et al.  An Automata-Theoretic Approach to Uniform Interpolation and Approximation in the Description Logic EL , 2012, KR.

[16]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

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

[18]  Dexter Kozen.  Theory of Computation , 2006, Texts in Computer Science.

[19]  Sebastian Rudolph,et al.  (Non-)Succinctness of uniform interpolants of general terminologies in the description logic EL , 2014, Artif. Intell..

[20]  Jeff Z. Pan,et al.  Forgetting for knowledge bases in DL-Lite , 2010, Annals of Mathematics and Artificial Intelligence.

[21]  Thomas Andreas Meyer,et al.  Reachability Modules for the Description Logic $\mathcal{SRIQ}$ , 2013, LPAR.

[22]  Marcelo Arenas,et al.  Foundations of Data Exchange , 2014 .

[23]  Boris Motik,et al.  Reasoning over Ontologies with Hidden Content: The Import-by-Query Approach , 2012, J. Artif. Intell. Res..

[24]  Carsten Lutz,et al.  Conservative Extensions in the Lightweight Description Logic EL , 2007, CADE.

[25]  Sebastian Rudolph,et al.  Complexity Boundaries for Horn Description Logics , 2007, AAAI.

[26]  Tomasz Imielinski,et al.  Incomplete Information in Relational Databases , 1984, JACM.

[27]  Diego Calvanese.  Scalable End-User Access to Big Data , 2014 .

[28]  Boris Konev,et al.  The Logical Difference for the Lightweight Description Logic EL , 2012, J. Artif. Intell. Res..

[29]  Patrick Koopmann,et al.  Count and Forget: Uniform Interpolation of $\mathcal{SHQ}$ -Ontologies , 2014, IJCAR.

[30]  Patrick Koopmann,et al.  Count and Forget : Uniform Interpolation of SHQ-Ontologies — Long Version ? , 2014 .

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

[32]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[33]  René Mazala,et al.  Infinite Games , 2001, Automata, Logics, and Infinite Games.

[34]  Sebastian Rudolph,et al.  Foundations of Semantic Web Technologies , 2009 .

[35]  Diego Calvanese,et al.  Linking Data to Ontologies , 2008, J. Data Semant..

[36]  Patrick Koopmann,et al.  Forgetting and Uniform Interpolation for ALC-Ontologies with ABoxes , 2014, Description Logics.

[37]  Dexter C. Kozen.  Theory of Computation (Texts in Computer Science) , 2006 .

[38]  Marcelo Arenas,et al.  Data exchange beyond complete data , 2013 .

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

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

[41]  Jürgen Umbrich,et al.  RDFS and OWL Reasoning for Linked Data , 2013, Reasoning Web.

[42]  Jérôme Euzenat,et al.  Ontology Matching: State of the Art and Future Challenges , 2013, IEEE Transactions on Knowledge and Data Engineering.

[43]  Sebastian Brandt,et al.  Polynomial Time Reasoning in a Description Logic with Existential Restrictions, GCI Axioms, and - What Else? , 2004, ECAI.

[44]  G. Gottlob,et al.  Query Answering in the Description Logic Horn-SHIQ ⋆ , 2008 .

[45]  ArenasMarcelo,et al.  Data exchange beyond complete data , 2013 .

[46]  Frank Wolter,et al.  Logic-based ontology comparison and module extraction, with an application to DL-Lite , 2010, Artif. Intell..

[47]  Diego Calvanese,et al.  Exchanging OWL 2 QL Knowledge Bases , 2013, IJCAI.

[48]  Chiara Del Vescovo,et al.  The Modular Structure of an Ontology: Atomic Decomposition , 2011, IJCAI.

[49]  Ian Horrocks,et al.  Supporting concurrent ontology development: Framework, algorithms and tool , 2011, Data Knowl. Eng..

[50]  Georg Gottlob,et al.  Query Answering in the Description Logic Horn- , 2008, JELIA.

[51]  Patrick Koopmann,et al.  Uniform Interpolation and Forgetting for ALC Ontologies with ABoxes , 2014, AAAI.

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

[53]  Ian Horrocks,et al.  Modular Reuse of Ontologies: Theory and Practice , 2008, J. Artif. Intell. Res..

[54]  Boris Konev,et al.  Conjunctive Query Inseparability of OWL 2 QL TBoxes , 2011, AAAI.

[55]  Stephan Tobies,et al.  Complexity results and practical algorithms for logics in knowledge representation , 2001, ArXiv.

[56]  Michael Zakharyaschev,et al.  An Introduction to Description Logics and Query Rewriting , 2014, Reasoning Web.

[57]  Stefano Spaccapietra,et al.  Modular Ontologies: Concepts, Theories and Techniques for Knowledge Modularization , 2009, Modular Ontologies.

[58]  Krishnendu Chatterjee,et al.  An O(n2) time algorithm for alternating Büchi games , 2011, SODA.

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