First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics

11/19/2020
by   Meghyn Bienvenu, et al.
2

We study FO-rewritability of conjunctive queries in the presence of ontologies formulated in a description logic between EL and Horn-SHIF, along with related query containment problems. Apart from providing characterizations, we establish complexity results ranging from ExpTime via NExpTime to 2ExpTime, pointing out several interesting effects. In particular, FO-rewriting is more complex for conjunctive queries than for atomic queries when inverse roles are present, but not otherwise.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2016

The Data Complexity of Description Logic Ontologies

We analyze the data complexity of ontology-mediated querying where the o...
research
04/18/2018

Computing FO-Rewritings in EL in Practice: from Atomic to Conjunctive Queries

A prominent approach to implementing ontology-mediated queries (OMQs) is...
research
06/06/2023

Description Logics with Abstraction and Refinement

Ontologies often require knowledge representation on multiple levels of ...
research
05/03/2022

Unique Characterisability and Learnability of Temporal Instance Queries

We aim to determine which temporal instance queries can be uniquely char...
research
09/19/2016

Extending Unification in EL to Disunification: The Case of Dismatching and Local Disunification

Unification in Description Logics has been introduced as a means to dete...
research
11/28/2022

Efficient Answer Enumeration in Description Logics with Functional Roles – Extended Version

We study the enumeration of answers to ontology-mediated queries when th...
research
02/28/2014

Nested Regular Path Queries in Description Logics

Two-way regular path queries (2RPQs) have received increased attention r...

Please sign up or login with your details

Forgot password? Click here to reset