On Computing Minimal EL -Subsumption Modules - Archive ouverte HAL Access content directly
Conference Papers Year :

On Computing Minimal EL -Subsumption Modules

Abstract

In the paper we study algorithms for computing minimal modules that are minimal w.r.t. set inclusion and that preserve the entailment of all EL- subsumptions over a signature of interest. We follow the black-box approach for finding one or all justifications by replacing the entailment tests with logical dif- ference checks, obtaining modules that preserve not only a given consequence but all entailments over a signature. Such minimal modules can serve to improve our understanding of the internal structure of large and complex ontologies. Addition- ally, several optimisations to speed up the computation of minimal modules are investigated. We present an experimental evaluation of an implementation of our algorithms by applying them on the medical ontologies Snomed CT and NCI.
Not file

Dates and versions

hal-01483476 , version 1 (06-03-2017)

Identifiers

  • HAL Id : hal-01483476 , version 1

Cite

Jieying Chen, Michel Ludwig, Dirk Walther. On Computing Minimal EL -Subsumption Modules. Proceedings of the Joint Ontology Workshops 2016, Jul 2016, Annecy, France. ⟨hal-01483476⟩
315 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More