Optimal Nonrecursive Datalog Rewritings of Linear TGDs and Bounded (Hyper)Tree-Width Queries

    Description Logics, 2017.

    Cited by: 1|Bibtex|Views8|Links
    EI

    Abstract:

    Our concern is answering ontology-mediated queries (O, q), where O 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 bound...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments