Temporal Query Answering in DL-Lite with Negation

Ontology-based query answering augments classical query answering in databases by adopting the open-world assumption and by including domain knowledge provided by an ontology. We investigate temporal query answering w.r.t. ontologies formulated in DL-Lite, a family of description logics that captures the conceptual features of relational databases and was tailored for efficient query answering. We consider a recently proposed temporal query language that combines conjunctive queries with the operators of propositional linear temporal logic (LTL). In particular, we consider negation in the ontology and query language, and study both data and combined complexity of query entailment.

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

[2]  M. Panella.  Associate Editor of the Journal of Computer and System Sciences , 2014 .

[3]  Howard Straubing,et al.  Regular Languages in NC¹ , 1992, J. Comput. Syst. Sci..

[4]  Stefan Borgwardt,et al.  Temporal Query Answering in the Description Logic EL , 2015, IJCAI.

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

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

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

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

[9]  Andreas Pieris,et al.  Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs , 2014, Description Logics.

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

[11]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

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

[13]  Veronika Thost,et al.  On Implementing Temporal Query Answering in DL-Lite (extended abstract) , 2015, Description Logics.

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

[15]  Andreas Pieris,et al.  The Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules , 2013, Description Logics.

[16]  Franz Baader,et al.  Temporal query entailment in the Description Logic SHQ , 2015, J. Web Semant..

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

[18]  N. Immerman,et al.  On uniformity within NC 1 . , 1988 .

[19]  Franz Baader,et al.  Temporal Conjunctive Queries in Expressive DLs with Non-simple Roles , 2015 .

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

[21]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[22]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

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

[24]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[25]  Thomas Andreas Meyer,et al.  Querying Temporal Databases via OWL 2 QL , 2014, RR.

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

[27]  Stefan Borgwardt,et al.  Temporal Query Answering in EL , 2015, Description Logics.

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

[29]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[30]  Frank Wolter,et al.  Temporal OBDA with LTL and DL-Lite , 2014, Description Logics.

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

[32]  Stefan Borgwardt,et al.  Temporalizing rewritable query languages over knowledge bases , 2015, J. Web Semant..

[33]  Stefan Borgwardt,et al.  LTL over EL Axioms , 2015 .

[34]  Franz Baader,et al.  Temporal Conjunctive Queries in Expressive Description Logics with Transitive Roles , 2015, Australasian Conference on Artificial Intelligence.

[35]  Jean Christoph Jung,et al.  Lightweight Description Logics and Branching Time: A Troublesome Marriage , 2014, KR.

[36]  BarringtonDavid A. Mix,et al.  Regular languages in NC1 , 1992 .

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

[38]  Diego Calvanese,et al.  Query Rewriting in DL-Lite_^(HN)_horn , 2010, Description Logics.

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

[40]  Jean Christoph Jung,et al.  Lightweight Temporal Description Logics with Rigid Roles and Restricted TBoxes , 2015, IJCAI.

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

[42]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

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

[44]  A. Meyer.  Review: Walter J. Savitch, Relationships between Nondeterministic and Deterministic Tape Complexities , 1974 .

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

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

[47]  Paul Gastin,et al.  Fast LTL to Büchi Automata Translation , 2001, CAV.

[48]  Davide Bresolin,et al.  DL-Lite and Interval Temporal Logics: a Marriage Proposal , 2014, ECAI.