On the Parametrised Complexity of Tree-Shaped Ontology-Mediated Queries in OWL 2 QL

    Description Logics, 2017.

    Cited by: 1|Bibtex|Views9|Links
    EI

    Abstract:

    We discuss the parameterised complexity of answering tree-shaped ontology-mediated queries (OMQs) in OWL 2 QL under various restrictions on their ontologies and conjunctive queries (CQs). In particular, we construct an ontology T such that answering OMQs (T , q) with tree-shaped CQs q is W[1]-hard if the number of leaves in q is regarded ...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments