Abstract
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 numeric predicates and operators are required in such reductions. We consider two ways of introducing a temporal dimension in ontologies and queries: using linear temporal logic LTL over discrete time and using metric temporal logic MTL over dense time.
Cite
CITATION STYLE
Ryzhikov, V., Wałęga, P. A., & Zakharyaschev, M. (2020). Temporal Ontology-Mediated Queries and First-Order Rewritability: A Short Course. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12258 LNCS, pp. 109–148). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-60067-9_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
