Temporal ontology-mediated queries and first-order rewritability: A short course
We discuss recent attempts to extend the ontology-based data access (aka virtual knowledge graph) paradigm to the temporal setting. Our main aim is to understand when answering temporal ontology mediated queries can be reduced to evaluating standard first-order queries over timestamped data and what...
Main Authors: | Ryzhikov, V, Walega, P, Zakharyaschev, M |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Springer
2020
|
Similar Items
-
Data complexity and rewritability of ontology-mediated queries in metric temporal logic under the event-based semantics
by: Ryzhikov, V, et al.
Published: (2019) -
On the succinctness of query rewriting over shallow ontologies
by: Kikot, Stanislav, et al.
Published: (2014) -
Ontology-mediated queries: Combined complexity and succinctness of rewritings via circuit complexity
by: Bienvenu, M, et al.
Published: (2018) -
Ontology-mediated queries: combined complexity and succinctness of rewritings via circuit complexity
by: Bienvenu, Meghyn, et al.
Published: (2018) -
The price of query rewriting in ontology-based data access
by: Gottlob, Georg, et al.
Published: (2014)