Temporal Query Answering in the Description Logic DL-Lite

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. For ontologies formulated in Description Logics of the DL-Lite family, OBDA can be realized by rewriting the query into a classical first-order query, e.g. an SQL query, by compiling the information of the ontology into the query. The query is then answered using classical database techniques.

[1]  Stefan Borgwardt,et al.  Temporal Query Answering in DL-Lite , 2013, Description Logics.

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

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

[4]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

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

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

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

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

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

[10]  Amir Pnueli,et al.  Temporal Logic in Specification , 1987, Lecture Notes in Computer Science.

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

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

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

[14]  Alessandro Artale,et al.  Temporal Conceptual Modelling with DL-Lite , 2010, Description Logics.

[15]  Leonardo Mendonça de Moura,et al.  Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals , 2013, CADE.

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

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

[18]  Alessandro Artale,et al.  A Cookbook for Temporal Conceptual Data Modelling with Description Logics , 2012, TOCL.

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

[20]  Marsha Chechik,et al.  Robust Vacuity for Branching Temporal Logic , 2010, TOCL.

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

[22]  Alessandro Artale,et al.  DL-Lite with Temporalised Concepts, Rigid Axioms and Roles , 2009, FroCoS.

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

[24]  Stefan Borgwardt,et al.  Temporal Query Answering w.r.t. DL-Lite-Ontologies , 2013 .

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

[26]  Cristina Sirangelo,et al.  Reasoning About Pattern-Based XML Queries , 2013, RR.

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

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