Data Access With Horn Ontologies: Where Description Logics Meet Existential Rules

Abstract

Two main families of ontology languages are considered in the context of data access, namely Horn description logics and existential rules. In this paper, we review the semantic relationships between these families in the light of the ontology-mediated query answering problem. To this end, we rely on the standard translation of description logics in first-order logic and on the notion of semantic emulation. We focus on description logics and classes of existential rules for which the con-junctive query answering problem has polynomial data complexity.