BIROn - Birkbeck Institutional Research Online

    On the data complexity of ontology-mediated queries with a covering axiom

    Gerasimova, O. and Kikot, S. and Podolskii, V. and Zakharyaschev, Michael (2017) On the data complexity of ontology-mediated queries with a covering axiom. In: Artale, A. and Glimm, B. and Kontchakov, Roman (eds.) DL 2017: International Workshop on Description Logics. CEUR Workshop Proceedings 1879 1879. CEUR Workshop Proceedings.

    Full text not available from this repository.


    This paper reports on our ongoing work that aims at a classification of conjunctive queries q according to the data complexity of answering ontologymediated queries ({A T F}; q). We give examples of queries from the complexity classes ϵ {AC0; L; NL; P; CONP}, and obtain a few syntactical conditions for -membership and -hardness.


    Item Type: Book Section
    Additional Information: 30th International Workshop on Description Logics, DL 2017; Montpellier; France; 18 July 2017 through 21 July 2017
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Administrator
    Date Deposited: 06 Sep 2017 14:09
    Last Modified: 19 Sep 2017 14:30


    Activity Overview

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item