On the parameterised complexity of tree-shaped ontology-mediated queries in OWL2QL

We discuss the parameterised complexity of answering tree-shaped ontology-mediated queries (OMQs) in OWL2QL under various restrictions on their ontologies and conjunctive queries (CQs). In particular, we construct an ontology τ such that answering OMQs (τ, q) with tree-shaped CQs q is W[1]- hard if the number of leaves in q is regarded as the parameter. The number of leaves has previously been identified as an important characteristic of CQs as bounding it leads to tractable OMQ answering. Our result shows that treating it as a parameter does not make the problem fixed-parameter tractable, even for a fixed ontology