2020/01/21 by Anneke Haga, Carsten Lutz, Haga, Anneke +5
Computer Science · #Advanced Database Systems and Queries #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Semantic Web and Ontologies
paper · pdf · doi:10.48550/arxiv.2001.07754
openalex publication_date 2020/01/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study complete approximations of an ontology formulated in a non-Horn description logic (DL) such as ALC in a Horn DL such as~EL. We provide concrete approximation schemes that are necessarily infinite and observe that in the ELU-to-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_\bot-to-EL_\bot and for ALC-to-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.