Temporalizing rewritable query languages over knowledge bases

Abstract Ontology-based data access (OBDA) generalizes query answering in relational databases. It allows to query a database by using the language of an ontology, abstracting from the actual relations of the database. OBDA can sometimes be realized by compiling the information of the ontology into the query and the database. The resulting query is then answered using classical database techniques. In this paper, we consider a temporal version of OBDA. We propose a generic temporal query language that combines linear temporal logic with queries over ontologies. This language is well-suited for expressing temporal properties of dynamic systems and is useful in context-aware applications that need to detect specific situations. We show that, if atemporal queries are rewritable in the sense described above, then the corresponding temporal queries are also rewritable such that we can answer them over a temporal database. We present three approaches to answering the resulting queries.

[1]  Jan Chomicki,et al.  Efficient checking of temporal integrity constraints using bounded history encoding , 1995, TODS.

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

[3]  Gunter Saake,et al.  Using Finite-Linear Temporal Logic for Specifying Database Dynamics , 1988, CSL.

[4]  Stijn Heymans,et al.  Tractable Reasoning with DL-Programs over Datalog-rewritable Description Logics , 2010, ECAI.

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

[6]  Boris Motik,et al.  Representing and querying validity time in RDF and OWL: A logic-based approach , 2010, J. Web Semant..

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

[8]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[9]  Sebastian Rudolph,et al.  Query Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ , 2011, IJCAI.

[10]  Enrico Franconi,et al.  A Temporal Description Logic for Reasoning over Conceptual Schemas and Queries , 2002, JELIA.

[11]  Carsten Lutz,et al.  The Combined Approach to Ontology-Based Data Access , 2011, IJCAI.

[12]  Dieter Fensel,et al.  Ontobroker: Ontology Based Access to Distributed and Semi-Structured Information , 1999, DS-8.

[13]  Markus Krötzsch.  Efficient Rule-Based Inferencing for OWL EL , 2011, IJCAI.

[14]  Szymon Klarman,et al.  Towards a Unifying Approach to Representing and Querying Temporal Data in Description Logics , 2012, RR.

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

[16]  Stefan Borgwardt,et al.  Temporal Query Answering in the Description Logic DL-Lite , 2013, FroCos.

[17]  Carsten Lutz,et al.  Data Complexity in the EL Family of Description Logics , 2007, LPAR.

[18]  Guohui Xiao,et al.  Tractable Queries for Lightweight Description Logics , 2013, IJCAI.

[19]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[20]  Franz Baader,et al.  LTL over description logic axioms , 2008, TOCL.

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

[22]  Ian Horrocks,et al.  The Even More Irresistible SROIQ , 2006, KR.

[23]  Franz Baader,et al.  Temporalizing Ontology-Based Data Access , 2013, CADE.

[24]  Dov M. Gabbay,et al.  The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems , 1987, Temporal Logic in Specification.

[25]  Diego Calvanese,et al.  DL-Lite: Tractable Description Logics for Ontologies , 2005, AAAI.

[26]  Thomas Wilke,et al.  Classifying Discrete Temporal Properties , 1999, STACS.

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

[28]  Gunter Saake,et al.  Theoretical foundations of handling large substitution sets in temporal integrity monitoring , 2005, Acta Informatica.

[29]  Sebastian Rudolph,et al.  Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend! , 2010, J. Artif. Intell. Res..

[30]  Philippe Schnoebelen,et al.  Temporal logic with forgettable past , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

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

[32]  Carsten Lutz,et al.  The Combined Approach to Query Answering in DL-Lite , 2010, KR.

[33]  Jan Chomicki,et al.  Querying ATSQL databases with temporal logic , 1996, TODS.

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

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

[36]  Boris Motik,et al.  Reasoning in Description Logics by a Reduction to Disjunctive Datalog , 2007, Journal of Automated Reasoning.

[37]  Ian Horrocks,et al.  Conjunctive Query Answering for the Description Logic SHIQ , 2007, IJCAI.

[38]  Andrea Calì,et al.  A general Datalog-based framework for tractable query answering over ontologies , 2012, J. Web Semant..

[39]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[40]  Thomas Eiter.  Datalog-Based Data Access over Ontology Knowledge Bases , 2013 .

[41]  Giorgio Orsi,et al.  Ontological queries: Rewriting and optimization , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[42]  Diego Calvanese,et al.  Rewriting of regular expressions and regular path queries , 1999, PODS '99.

[43]  David Toman,et al.  Logical data expiration , 2002, Proceedings Ninth International Symposium on Temporal Representation and Reasoning.

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

[45]  Carsten Lutz,et al.  Temporalising Tractable Description Logics , 2007, 14th International Symposium on Temporal Representation and Reasoning (TIME'07).

[46]  David Toman,et al.  Time in Database Systems , 2014 .

[47]  Christian S. Jensen,et al.  Temporal statement modifiers , 2000, TODS.

[48]  Frank Wolter,et al.  Temporal Description Logic for Ontology-Based Data Access , 2013, IJCAI.

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

[50]  Andrea Calì,et al.  A general datalog-based framework for tractable query answering over ontologies , 2009, SEBD.

[51]  Serge Abiteboul,et al.  Regular path queries with constraints , 1997, J. Comput. Syst. Sci..

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

[53]  Carsten Lutz,et al.  Temporal Description Logics: A Survey , 2008, 2008 15th International Symposium on Temporal Representation and Reasoning.

[54]  Franz Baader,et al.  How Pervasive Is the Myerson-Satterthwaite Impossibility? , 2009, IJCAI.

[55]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.