Lutz, Carsten and Wolter, Frank - The Data Complexity of Description Logic Ontologies

lmcs:4060 - Logical Methods in Computer Science, November 13, 2017, Volume 13, Issue 4
The Data Complexity of Description Logic Ontologies

Authors: Lutz, Carsten and Wolter, Frank

We analyze the data complexity of ontology-mediated querying where the ontologies are formulated in a description logic (DL) of the ALC family and queries are conjunctive queries, positive existential queries, or acyclic conjunctive queries. Our approach is non-uniform in the sense that we aim to understand the complexity of each single ontology instead of for all ontologies formulated in a certain language. While doing so, we quantify over the queries and are interested, for example, in the question whether all queries can be evaluated in polynomial time w.r.t. a given ontology. Our results include a PTime/coNP-dichotomy for ontologies of depth one in the description logic ALCFI, the same dichotomy for ALC- and ALCI-ontologies of unrestricted depth, and the non-existence of such a dichotomy for ALCF-ontologies. For the latter DL, we additionally show that it is undecidable whether a given ontology admits PTime query evaluation. We also consider the connection between PTime query evaluation and rewritability into (monadic) Datalog.


Source : oai:arXiv.org:1611.02453
DOI : 10.23638/LMCS-13(4:7)2017
Volume: Volume 13, Issue 4
Published on: November 13, 2017
Submitted on: November 9, 2016
Keywords: Computer Science - Artificial Intelligence


Share

Browsing statistics

This page has been seen 29 times.
This article's PDF has been downloaded 13 times.