Deciding FO-rewritability of ontology-mediated queries in linear temporal logic

Ryzhikov, Vladislav and Savateev, Yury and Zakhariyashchev, Michael (2021) Deciding FO-rewritability of ontology-mediated queries in linear temporal logic. In: TIME 2021: 28th International Symposium on Temporal Representation and Reasoning, 27-29 September 2021, University of Klagenfurt, Austria (online).

Abstract

Our concern is the problem of determining the data complexity of answering an ontology-mediated query (OMQ) given in linear temporal logic LTL over (Z,<) and deciding whether it is rewritable to an FO(<)-query, possibly with extra predicates. First, we observe that, in line with the circuit complexity and FO-definability of regular languages, OMQ answering in AC0, ACC0 and NC1 coincides with FO(<,\equiv)-rewritability using unary predicates x \equiv 0 mod n), FO(<,MOD)-rewritability, and FO(RPR)-rewritability using relational primitive recursion, respectively. We then show that deciding FO(<)-, \FO(<,\equiv)- and FO(<,MOD)-rewritability of LTL OMQs is ExpSpace-complete, and that these problems become PSpace-complete for OMQs with a linear Horn ontology and an atomic query, and also a positive query in the cases of FO(<)- and FO(<,\equiv)-rewritability. Further, we consider FO(<)-rewritability of OMQs with a binary-clause ontology and identify OMQ classes, for which deciding it is PSpace-, Pi_2^p- and coNP-complete.

Metadata

Statistics

DownloadsShow export options

Export as XMLJSONCSV

Activity Overview

6 month trend

25Downloads

6 month trend

66Hits

Additional statistics are available via IRStats2.

Archive Staff Only (login required)

Edit/View Item