Module extraction in expressive ontology languages via datalog reasoning

Journal article

Module extraction is the task of computing a (preferably small) fragment M of an ontology O that preserves a class of entailments over a signature of interest E. Extracting modules of minimal size is well-known to be computationally hard, and often algorithmically infeasible, especially for highly expressive ontology languages. Thus, practical techniques typically rely on approximations, where M provably captures the relevant entailments, but is not guaranteed to be minimal. Existing approximations ensure that M preserves all second-order entailments of O w.r.t. E, which is a stronger condition than is required in many applications, and may lead to unnecessarily large modules in practice. In this paper we propose a novel approach in which module extraction is reduced to a reasoning problem in datalog. Our approach generalises existing approximations in an elegant way. More importantly, it allows extraction of modules that are tailored to preserve only specific kinds of entailments, and thus are often significantly smaller. Our evaluation on a wide range of ontologies confirms the feasibility and benefits of our approach in practice.

Authors: Grau, B; Kaminski, M; Romero, A; Horrocks, I

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Association for the Advancement of Artificial Intelligence
• Journal: Journal of Artificial Intelligence Research
• Volume: 55
• Pages: 499-564
• Publication date: 2016-02-29
• Acceptance date: 2016-02-22
• DOI: 10.1613/jair.4898
• EISSN: 1943-5037
• ISSN: 1076-9757