The Data Complexity of Ontology-Mediated Queries with Closed Predicates

Lutz, Carsten, Seylan, Inanc and Wolter, Frank
(2019) The Data Complexity of Ontology-Mediated Queries with Closed Predicates. Logical Methods in Computer Science, 15 (3). 2019-.

[img] Text
closedpredicateslmcs.pdf - Author Accepted Manuscript

Download (506kB) | Preview


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.

Item Type: Article
Uncontrolled Keywords: cs.LO, cs.LO, Computer Science, Logic in Computer Science, 68
Depositing User: Symplectic Admin
Date Deposited: 10 Jun 2019 09:06
Last Modified: 19 Jan 2023 00:40
DOI: 10.23638/LMCS-15(3:23)2019
Related URLs: