# Temporal Query Answering in the Description Logic DL-Lite

##### Stefan BorgwardtStefan Borgwardt,  Marcel LippmannMarcel Lippmann,  Veronika ThostVeronika Thost
Stefan Borgwardt, Marcel Lippmann, Veronika Thost
Temporal Query Answering in the Description Logic DL-Lite
In Pascal Fontaine and Christophe Ringeissen and Renate A. Schmidt, eds., Proceedings of the 9th International Symposium on Frontiers of Combining Systems (FroCoS 2013), volume 8152 of Lecture Notes in Computer Science, 165-180, 2013. Springer
• 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 paper, 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 to express 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.
• Projekt:Project: HAEC B02
• Forschungsgruppe:Research Group: Automatentheorie
The final publication is available at Springer.
@inproceedings{ BoLiTh-FroCoS13,