LATPub601: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
||
| Zeile 18: | Zeile 18: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=Ontology-based data access (OBDA) generalizes query answering in relational | |Abstract=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. OBDA can sometimes be realized by compiling the information of the ontology into the query and the database. The resulting query is then answered using classical database techniques. | ||
databases. It allows to query a database by using the language of an ontology, | In this paper, we consider a temporal version of OBDA. We propose a generic temporal query language that combines linear temporal logic with queries over ontologies. This language is well-suited for expressing temporal properties of dynamic systems and is useful in context-aware applications that need to detect specific situations. We show that, if atemporal queries are rewritable in the sense described above, then the corresponding temporal queries are also rewritable such that we can answer them over a temporal database. We present three approaches to answering the resulting queries. | ||
abstracting from the actual relations of the database. OBDA can sometimes be | |||
realized by compiling the information of the ontology into the query and the | |||
database. The resulting query is then answered using classical database | |||
techniques. | |||
In this paper, we consider a temporal version of OBDA. We propose a generic | |||
temporal query language that combines linear temporal logic with queries over | |||
ontologies. This language is well-suited for expressing temporal properties of | |||
dynamic systems and is useful in context-aware applications that need to detect | |||
specific situations. We show that, if atemporal queries are rewritable in the | |||
sense described above, then the corresponding temporal queries are also | |||
rewritable such that we can answer them over a temporal database. We present | |||
three approaches to answering the resulting queries. | |||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 49: | Zeile 36: | ||
year = {2015}, | year = {2015}, | ||
} | } | ||
}} | }} | ||
Version vom 23. März 2015, 12:24 Uhr
Temporalizing Rewritable Query Languages over Knowledge Bases
Stefan BorgwardtStefan Borgwardt, Marcel LippmannMarcel Lippmann, Veronika ThostVeronika Thost
Stefan Borgwardt, Marcel Lippmann, Veronika Thost
Temporalizing Rewritable Query Languages over Knowledge Bases
Journal of Web Semantics, to appear
Temporalizing Rewritable Query Languages over Knowledge Bases
Journal of Web Semantics, to appear
- 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. OBDA can sometimes be realized by compiling the information of the ontology into the query and the database. The resulting query is then answered using classical database techniques. In this paper, we consider a temporal version of OBDA. We propose a generic temporal query language that combines linear temporal logic with queries over ontologies. This language is well-suited for expressing temporal properties of dynamic systems and is useful in context-aware applications that need to detect specific situations. We show that, if atemporal queries are rewritable in the sense described above, then the corresponding temporal queries are also rewritable such that we can answer them over a temporal database. We present three approaches to answering the resulting queries. - Bemerkung: Note: In press.
- Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@article{ BoLT-JWS15,
author = {Stefan {Borgwardt} and Marcel {Lippmann} and Veronika {Thost}},
doi = {http://dx.doi.org/10.1016/j.websem.2014.11.007},
journal = {Journal of Web Semantics},
note = {In press.},
title = {Temporalizing Rewritable Query Languages over Knowledge Bases},
year = {2015},
}
