BIROn - Birkbeck Institutional Research Online

    First-order rewritability of ontology-mediated queries in linear temporal logic

    Artale, A. and Kontchakov, Roman and Kovtunova, A. and Ryzhikov, Vladislav and Wolter, F. and Zakhariyashchev, Michael (2021) First-order rewritability of ontology-mediated queries in linear temporal logic. Artificial Intelligence 299 , ISSN 0004-3702.

    [img] Text
    LTL-main.pdf - Author's Accepted Manuscript
    Restricted to Repository staff only until 19 May 2022.
    Available under License Creative Commons Attribution Non-commercial No Derivatives.

    Download (373kB) | Request a copy

    Abstract

    We investigate ontology-based data access to temporal data. We consider temporal ontologies given in linear temporal logic LTL interpreted over discrete time (Z; <). Queries are given in LTL or MFO(<), monadic first-order logic with a built-in linear order. Our concern is first-order rewritability of ontology-mediated queries (OMQs) consisting of a temporal ontology and a query. By taking account of the temporal operators used in the ontology and distinguishing between ontologies given in full LTL and its core, Krom and Horn fragments, we identify a hierarchy of OMQs with atomic queries by proving rewritability into either FO(<), first-order logic with the built-in linear order, or FO(<, \equiv), which extends FO(<) with the standard arithmetic predicates x \equiv 0 (mod n), for any fixed n > 1, or FO(RPR), which extends FO(<) with relational primitive recursion. In terms of circuit complexity, FO(<, \equiv)- and FO(RPR)-rewritability guarantee OMQ answering in uniform AC0 and, respectively, NC1. We obtain similar hierarchies for more expressive types of queries: positive LTL-formulas, monotone MFO(<)- and arbitrary MFO(<)-formulas. Our results are directly applicable if the temporal data to be accessed is one-dimensional; moreover, they lay foundations for investigating ontology-based access using combinations of temporal and description logics over two-dimensional temporal data.

    Metadata

    Item Type: Article
    Keyword(s) / Subject(s): Linear temporal logic, Description logic, Ontology-based data access, First-order rewritability, Data complexity
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Roman Kontchakov
    Date Deposited: 28 Jun 2021 08:47
    Last Modified: 30 Jun 2021 06:23
    URI: https://eprints.bbk.ac.uk/id/eprint/44873

    Statistics

    Downloads
    Activity Overview
    1Download
    21Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item