Journal ArticleOPEN ACCESS

First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries

Journal of Artificial Intelligence Research (2022) 75 1223-1291
DOI: 10.1613/jair.1.13511
11Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

Abstract

Aiming at ontology-based data access to temporal data, we design two-dimensional temporal ontology and query languages by combining logics from the (extended) DL-Lite family with linear temporal logic LTL over discrete time (Z, < and for the domain of individuals—its extension FO( 1, and FO(RPR) that admits relational primitive recursion. In terms of circuit complexity, FO(

Cite

CITATION STYLE

APA

Artale, A., Kontchakov, R., Kovtunova, A., Ryzhikov, V., Wolter, F., & Zakharyaschev, M. (2022). First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries. Journal of Artificial Intelligence Research, 75, 1223–1291. https://doi.org/10.1613/jair.1.13511

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free