BIROn - Birkbeck Institutional Research Online

    Optimal nonrecursive datalog rewritings of linear TGDs and bounded (Hyper)Tree-width queries

    Bienvenu, M. and Kikot, S. and Kontchakov, Roman and Ryzhikov, V. and Zakharyaschev, Michael (2017) Optimal nonrecursive datalog rewritings of linear TGDs and bounded (Hyper)Tree-width queries. In: Artale, A. and Glimm, B. and Kontchakov, Roman (eds.) DL 2017: International Workshop on Description Logics. CEUR Workshop Proceedings 1879 1879. CEUR.

    Full text not available from this repository.

    Abstract

    Our concern is answering ontology-mediated queries (Ο q), whereΟ is a set of linear tgds and q a conjunctive query (CQ) of bounded hypertree width. Assuming that the arity of predicates is bounded, we show that polynomial-size nonrecursive Datalog rewritings can be constructed and executed in (i) LOGCFL for OMQs with ontologies of bounded existential depth; (ii) NL for OMQs with ontologies of bounded depth and CQs whose hypertree decompositions have a bounded number of leaves; (iii) LOGCFL for OMQs with acyclic CQs whose join trees have a bounded number of leaves.

    Metadata

    Item Type: Book Section
    Additional Information: 30th International Workshop on Description Logics, DL 2017; Montpellier; France; 18 July 2017 through 21 July 2017
    Keyword(s) / Subject(s): Forestry, Formal languages, Ontology
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Administrator
    Date Deposited: 06 Sep 2017 14:05
    Last Modified: 07 Sep 2017 14:56
    URI: http://eprints.bbk.ac.uk/id/eprint/19605

    Statistics

    Downloads
    Activity Overview
    0Downloads
    65Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item