The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries

    PODS, 2017.

    Cited by: 13|Bibtex|Views20|Links
    EI

    Abstract:

    Our concern is the overhead of answering OWL 2 QL ontology-mediated queries (OMQs) in ontology-based data access compared to evaluating their underlying tree-shaped and, more generally, bounded treewidth conjunctive queries (CQs). We show that OMQs with bounded depth ontologies have nonrecursive datalog (NDL) rewritings that can be constr...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments