Abstract

We study complete approximations of an ontology formulated in a non-Horn description logic (DL) such as ALC\mathcal{ALC} in a Horn DL such as~EL\mathcal{EL}. We provide concrete approximation schemes that are necessarily infinite and observe that in the ELU\mathcal{ELU}-to-EL\mathcal{EL} case finite approximations tend to exist in practice and are guaranteed to exist when the original ontology is acyclic. In contrast, neither of this is the case for ELU⊥\mathcal{ELU}_\bot-to-EL⊥\mathcal{EL}_\bot and for ALC\mathcal{ALC}-to-EL⊥\mathcal{EL}_\bot approximations. We also define a notion of approximation tailored towards ontology-mediated querying, connect it to subsumption-based approximations, and identify a case where finite approximations are guaranteed to exist.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.