Weak subsumption in the EL-description logic with refreshing variables - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2021

Weak subsumption in the EL-description logic with refreshing variables

Abstract

In this paper, we study the problem of reasoning in description logics with variables. More specifically, we consider refreshing semantics for variables in the context of the EL description logic. We investigate a particular reason- ing mechanism, namely weak subsumption, in presence of terminological cycles. Weak subsumption can be viewed as a generalization of matching and unifica- tion in presence of refreshing variables. We show that weak subsumption w.r.t. greatest fix-point semantic is EXPTIME-complete. Our main technical results are derived by establishing a correspondence between this logic and a specific form of variable automata.
Fichier principal
Vignette du fichier
Weak subsumption in the EL-description logic with refreshing variables [Extended Version].pdf (374.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03260408 , version 1 (14-06-2021)
hal-03260408 , version 2 (08-07-2021)
hal-03260408 , version 3 (13-07-2021)

Identifiers

  • HAL Id : hal-03260408 , version 3

Cite

Théo Ducros, Marinette Bouet, Farouk Toumani. Weak subsumption in the EL-description logic with refreshing variables. 2021. ⟨hal-03260408v3⟩
162 View
96 Download

Share

Gmail Facebook X LinkedIn More