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

Abstract

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.

Cited by in corpus (6)

• Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics
• The Data Complexity of Description Logic Ontologies
• The Data Complexity of Ontology-Mediated Queries with Closed Predicates
• Query-Based Entailment and Inseparability for ALC Ontologies (Full Version)
• Conservative Extensions in Horn Description Logics with Inverse Roles
• When is Ontology-Mediated Querying Efficient?