Computing ALCH-Subsumption Modules Using Uniform Interpolation

Patrick Koopmann (1) , Jieying Chen (2)

1 TU Dresden - Technische Universität Dresden = Dresden University of Technology
2 LaHDAK - LRI - Données et Connaissances Massives et Hétérogènes (LRI)

We investigate how minimal subsumption modules can be extracted using methods for uniform interpolation and forgetting. Given an ontology and a signature of concept and role names, a subsumption module is a subset of the ontology that preserves all logical entailments that can be expressed in the description logic of the ontology using only terms in the specified signature. As such, they are useful for ontology reuse and ontology analysis. While there exists a range of methods for computing or approximating minimal modules for a range of module types, we are not aware of a practical, implemented method for computing minimal subsumption modules in description logics beyond ELH. In this paper, we present a method that uses uniform interpolation/forgetting to compute subsumption modules in ALCH, and which under certain conditions guarantees minimality of the extracted modules. As a side product , our method computes a so-called LK subsumption module, which over-approximates the union of all minimal subsumption modules, and as such may already have applications of its own. We further present an initial evaluation of this method on a varied corpus of ontologies.

Domaines: Intelligence artificielle [cs.AI]

Patrick Koopmann, Jieying Chen. Computing ALCH-Subsumption Modules Using Uniform Interpolation. SOQE 2017 Workshop on Second-Order Quantifier Elimination and Related Topics, Dec 2017, Dresden, Germany. ⟨hal-01712802⟩