# Temporal Query Answering w.r.t. DL-Lite-Ontologies

##### Stefan BorgwardtStefan Borgwardt,  Marcel LippmannMarcel Lippmann,  Veronika ThostVeronika Thost
Stefan Borgwardt, Marcel Lippmann, Veronika Thost
Technical Report, Chair of Automata Theory, TU Dresden, volume 13-05, 2013. LTCS-Report
• KurzfassungAbstract
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.

In this report, we consider a temporal version of OBDA. We propose a temporal query language that combines a linear temporal logic with queries over DL-Lite-core-ontologies. This language is well-suited for expressing temporal properties of dynamical systems and is useful in context-aware applications that need to detect specific situations.

Using a first-order rewriting approach, we transform our temporal queries into queries over a temporal database. We then present three approaches to answering the resulting queries, all having different advantages and drawbacks.
• Bemerkung: Note: Revised version. See http://lat.inf.tu-dresden.de/research/reports.html.
• Forschungsgruppe:Research Group: Automatentheorie
@techreport{ BoLT-LTCS-13-05,