BIROn - Birkbeck Institutional Research Online

    A tetrachotomy of ontology-mediated queries with a covering axiom

    Gerasimova, O. and Kikot, S. and Kurucz, A. and Podolskii, V. and Zakharyashchev, Michael (2022) A tetrachotomy of ontology-mediated queries with a covering axiom. Artificial Intelligence 309 , p. 103738. ISSN 0004-3702.

    [img]
    Preview
    Text
    48202a.pdf - Published Version of Record
    Available under License Creative Commons Attribution.

    Download (1MB) | Preview

    Abstract

    Our concern is the problem of efficiently determining the data complexity of answering queries mediated by descrip- tion logic ontologies and constructing their optimal rewritings to standard database queries. Originated in ontology- based data access and datalog optimisation, this problem is known to be computationally very complex in general, with no explicit syntactic characterisations available. In this article, aiming to understand the fundamental roots of this difficulty, we strip the problem to the bare bones and focus on Boolean conjunctive queries mediated by a simple cov- ering axiom stating that one class is covered by the union of two other classes. We show that, on the one hand, these rudimentary ontology-mediated queries, called disjunctive sirups (or d-sirups), capture many features and difficulties of the general case. For example, answering d-sirups is Π2p-complete for combined complexity and can be in AC0 or L-, NL-, P-, or coNP-complete for data complexity (with the problem of recognising FO-rewritability of d-sirups be- ing 2ExpTime-hard); some d-sirups only have exponential-size resolution proofs, some only double-exponential-size positive existential FO-rewritings and single-exponential-size nonrecursive datalog rewritings. On the other hand, we prove a few partial sufficient and necessary conditions of FO- and (symmetric/linear-) datalog rewritability of d- sirups. Our main technical result is a complete and transparent syntactic AC0 / NL / P / coNP tetrachotomy of d-sirups with disjoint covering classes and a path-shaped Boolean conjunctive query. To obtain this tetrachotomy, we develop new techniques for establishing P- and coNP-hardness of answering non-Horn ontology-mediated queries as well as showing that they can be answered in NL.

    Metadata

    Item Type: Article
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Michael Zakhariyashchev
    Date Deposited: 07 Jun 2022 10:32
    Last Modified: 09 Jun 2022 05:16
    URI: https://eprints.bbk.ac.uk/id/eprint/48202

    Statistics

    Activity Overview
    6 month trend
    8Downloads
    6 month trend
    10Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item