Computing Minimal Subsumption Modules of Ontologies

13 pages•Published: September 17, 2018

Jieying Chen, Michel Ludwig and Dirk Walther

Abstract

In the paper we study algorithms for computing modules that are minimal w.r.t. set inclusion and that preserve the entailment of all 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 difference 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. Additionally, several optimisations for speeding up the computation of minimal modules are investigated. We present an experimental evaluation of an implementation of our algorithms for ELH r-terminologies by applying them on the prominent medical ontologies Snomed CT and NCI Thesaurus.

Keyphrases: description logics, knowledge representation, logical difference, ontology modularity

In: Daniel Lee, Alexander Steen and Toby Walsh (editors). GCAI-2018. 4th Global Conference on Artificial Intelligence, vol 55, pages 41-53.

Links:	https://easychair.org/publications/paper/7t4L
	https://doi.org/10.29007/tz7k

BibTeX entry

@inproceedings{GCAI-2018:Computing_Minimal_Subsumption_Modules,
  author    = {Jieying Chen and Michel Ludwig and Dirk Walther},
  title     = {Computing Minimal Subsumption Modules of Ontologies},
  booktitle = {GCAI-2018. 4th Global Conference on Artificial Intelligence},
  editor    = {Daniel Lee and Alexander Steen and Toby Walsh},
  series    = {EPiC Series in Computing},
  volume    = {55},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/7t4L},
  doi       = {10.29007/tz7k},
  pages     = {41-53},
  year      = {2018}}

Download PDF Open PDF in browser