Temporal Query Answering in the Description Logic EL

Context-aware systems use data collected at runtime to recognize certain predefined situations and trigger adaptations. This can be implemented using ontology-based data access (OBDA), which augments classical query answering in databases by adopting the open-world assumption and including domain knowledge provided by an ontology. We investigate temporalized OBDA w.r.t. ontologies formulated in EL, a description logic that allows for efficient reasoning and is successfully used in practice. We consider a recently proposed temporalized query language that combines conjunctive queries with the operators of propositional linear temporal logic (LTL), and study both data and combined complexity of query entailment in this setting. We also analyze the satisfiability problem in the similar formalism EL-LTL.

[1]  Stefano Spaccapietra,et al.  Journal on Data Semantics I , 2003, Lecture Notes in Computer Science.

[2]  A. Wilkie.  THE CLASSICAL DECISION PROBLEM (Perspectives in Mathematical Logic) By Egon Börger, Erich Grädel and Yuri Gurevich: 482 pp., DM.158.–, ISBN 3 540 57073 X (Springer, 1997). , 1998 .

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

[4]  Dan Suciu,et al.  Journal of the ACM , 2006 .

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

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

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

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

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

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

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

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

[13]  Amir Pnueli,et al.  The Glory of the Past , 1985, Logic of Programs.

[14]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

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

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

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

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

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

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

[21]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

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

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

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

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

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

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

[28]  Harry R. Lewis,et al.  Complexity of solvable cases of the decision problem for the predicate calculus , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).