A Journey into Ontology Approximation: From Non-Horn to Horn
This work addresses the challenge of simplifying complex ontologies for more efficient reasoning, particularly in ontology-mediated querying, but is incremental as it builds on existing approximation schemes.
The paper tackles the problem of approximating non-Horn description logic ontologies with Horn ones, showing that finite approximations exist in practice for certain cases like ELU-to-EL with acyclic ontologies, but not for others such as ELU⊥-to-EL⊥ or ALC-to-EL⊥.
We study complete approximations of an ontology formulated in a non-Horn description logic (DL) such as $\mathcal{ALC}$ in a Horn DL such as~$\mathcal{EL}$. We provide concrete approximation schemes that are necessarily infinite and observe that in the $\mathcal{ELU}$-to-$\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 $\mathcal{ELU}_\bot$-to-$\mathcal{EL}_\bot$ and for $\mathcal{ALC}$-to-$\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.