The Data Complexity of Ontology-Mediated Queries with Closed Predicates

09/01/2018
by   Carsten Lutz, et al.
0

In the context of ontology-mediated querying with description logics (DLs), we study the data complexity of queries in which selected predicates can be closed (OMQCs). We provide a non-uniform analysis, aiming at a classification of the complexity into tractable and non-tractable for ontologies in the lightweight DLs DL-Lite and EL, and the expressive DL ALCHI. At the level of ontologies, we prove a dichotomy between FO-rewritable and coNP-complete for DL-Lite and between PTime and coNP-complete for EL. The meta problem of deciding tractability is proved to be in PTime. At the level of OMQCs, we show that there is no dichotomy (unless NP equals PTime) if both concept and role names can be closed. If only concept names can be closed, we tightly link the complexity of query evaluation to the complexity of surjective CSPs. We also identify a class of OMQCs based on ontologies formulated in DL-Lite that are guaranteed to be tractable and even FO-rewritable.

READ FULL TEXT
research
11/08/2016

The Data Complexity of Description Logic Ontologies

We analyze the data complexity of ontology-mediated querying where the o...
research
03/17/2020

When is Ontology-Mediated Querying Efficient?

In ontology-mediated querying, description logic (DL) ontologies are use...
research
03/17/2022

Expressivity of Planning with Horn Description Logic Ontologies (Technical Report)

State constraints in AI Planning globally restrict the legal environment...
research
04/20/2015

Computing Horn Rewritings of Description Logics Ontologies

We study the problem of rewriting an ontology O1 expressed in a DL L1 in...
research
11/12/2021

First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries

Aiming at ontology-based data access to temporal data, we design two-dim...
research
01/31/2019

Query Inseparability for ALC Ontologies

We investigate the problem whether two ALC ontologies are indistinguisha...
research
01/21/2020

A Journey into Ontology Approximation: From Non-Horn to Hon

We study complete approximations of an ontology formulated in a non-Horn...

Please sign up or login with your details

Forgot password? Click here to reset