Computing EL minimal modules: a combined approach - Laboratoire Interdisciplinaire des Sciences du Numérique Access content directly
Conference Papers Year : 2022

Computing EL minimal modules: a combined approach

Abstract

Because widely used real-world ontologies are often complex and large, one important challenge has emerged: designing tools for users to focus on sub-ontologies corresponding to their specific interests. To this end, minimal modules have been introduced to provide concise ontology views. However, computing such minimal modules remains highly time-consuming. In this paper, we design a new method combining graph and SAT techniques, to address the computation cost of minimal modules. Our approach first introduces a new abstract notion of invariant to characterize sub-ontologies sharing the same logical information. Then, we construct a finite invariant using graph representations of EL ontologies. Finally, we develop a SAT-based algorithm to compute minimal modules using this invariant. Finally, in some cases, when the computation is still too time-consuming, we provide approximations of minimal modules. Our experiments on real-world ontologies outperform the state-of-the-art algorithm. Our algorithm provides more compact approximate results than the well-known locality-based modules without losing efficiency. CCS CONCEPTS • Computing methodologies → Description logics.
Fichier principal
Vignette du fichier
BDA_2022_paper_3272.pdf (608.34 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04429001 , version 1 (06-02-2024)

Identifiers

  • HAL Id : hal-04429001 , version 1

Cite

Hui Yang, Yue Ma, Nicole Bidoit. Computing EL minimal modules: a combined approach. BDA2022 :« Gestion de Données – Principes, Technologies et Applications », Oct 2022, Clermont-Ferrand, France. ⟨hal-04429001⟩
22 View
13 Download

Share

Gmail Mastodon Facebook X LinkedIn More