A Journey into Ontology Approximation: From Non-Horn to Horn
Artificial Intelligence
2020-06-17 v4 Logic in Computer Science
Abstract
We study complete approximations of an ontology formulated in a non-Horn description logic (DL) such as in a Horn DL such as~. We provide concrete approximation schemes that are necessarily infinite and observe that in the -to- 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 -to- and for -to- 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.
Keywords
Cite
@article{arxiv.2001.07754,
title = {A Journey into Ontology Approximation: From Non-Horn to Horn},
author = {Anneke Haga and Carsten Lutz and Johannes Marti and Frank Wolter},
journal= {arXiv preprint arXiv:2001.07754},
year = {2020}
}
Comments
21 pages, 4 figures, paragraph with examples added