BIROn - Birkbeck Institutional Research Online

    First-order rewritability and complexity of two-dimensional temporal ontology-mediated queries

    Artale, A. and Kontchakov, Roman and Kovtunova, A. and Ryzhikov, Vladislav and Wolter, F. and Zakharyashchev, Michael (2022) First-order rewritability and complexity of two-dimensional temporal ontology-mediated queries. Journal of Artificial Intelligence Research 75 , pp. 1223-1291. ISSN 1076-9757.

    [img]
    Preview
    Text
    49695a.pdf - Published Version of Record

    Download (924kB) | Preview

    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,<). Our main concern is first-order rewritability of ontology-mediated queries (OMQs) that consist of a 2D ontology and a positive temporal instance query. Our target languages for FO-rewritings are two-sorted FO(<)—first-order logic with sorts for time instants ordered by the built-in precedence relation < and for the domain of individuals—its extension FO(<,≡) with the standard congruence predicates t ≡ 0 (mod n), for any fixed n > 1, and FO(RPR) that admits relational primitive recursion. In terms of circuit complexity, FO(<,≡)- and FO(RPR)- rewritability guarantee answering OMQs in uniform AC0 and NC1, respectively. We proceed in three steps. First, we define a hierarchy of 2D DL-Lite/LTL ontology languages and investigate the FO-rewritability of OMQs with atomic queries by constructing projections onto 1D LTL OMQs and employing recent results on the FO-rewritability of propositional LTL OMQs. As the projections involve deciding consistency of ontologies and data, we also consider the consistency problem for our languages. While the undecidability of consistency for 2D ontology languages with expressive Boolean role inclusions might be expected, we also show that, rather surprisingly, the restriction to Krom and Horn role inclusions leads to decidability (and ExpSpace-completeness), even if one admits full Booleans on concepts. As a final step, we lift some of the rewritability results for atomic OMQs to OMQs with expressive positive temporal instance queries. The lifting results are based on an in-depth study of the canonical models and only concern Horn ontologies.

    Metadata

    Item Type: Article
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
    Depositing User: Roman Kontchakov
    Date Deposited: 09 Jan 2023 06:57
    Last Modified: 09 Aug 2023 12:53
    URI: https://eprints.bbk.ac.uk/id/eprint/49695

    Statistics

    Activity Overview
    6 month trend
    34Downloads
    6 month trend
    61Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item