DeepAI AI Chat
Log In Sign Up

A Complete Classification of the Complexity and Rewritability of Ontology-Mediated Queries based on the Description Logic EL

by   Carsten Lutz, et al.

We provide an ultimately fine-grained analysis of the data complexity and rewritability of ontology-mediated queries (OMQs) based on an EL ontology and a conjunctive query (CQ). Our main results are that every such OMQ is in AC0, NL-complete, or PTime-complete and that containment in NL coincides with rewritability into linear Datalog (whereas containment in AC0 coincides with rewritability into first-order logic). We establish natural characterizations of the three cases in terms of bounded depth and (un)bounded pathwidth, and show that every of the associated meta problems such as deciding wether a given OMQ is rewritable into linear Datalog is ExpTime-complete. We also give a way to construct linear Datalog rewritings when they exist and prove that there is no constant Datalog rewritings.


Deciding FO-rewritability of regular languages and ontology-mediated queries in Linear Temporal Logic

Our concern is the problem of determining the data complexity of answeri...

Ontology-Mediated Querying on Databases of Bounded Cliquewidth

We study the evaluation of ontology-mediated queries (OMQs) on databases...

Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results

This paper investigates the impact of query topology on the difficulty o...

Answer Counting under Guarded TGDs

We study the complexity of answer counting for ontology-mediated queries...

First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries

We focus on ontology-mediated queries (OMQs) based on (frontier-)guarded...

A data complexity and rewritability tetrachotomy of ontology-mediated queries with a covering axiom

Aiming to understand the data complexity of answering conjunctive querie...

Bounded-Memory Criteria for Streams with Application Time

Bounded-memory computability continues to be in the focus of those areas...