SROIQsigma is decidable
share
We consider a dynamic extension of the description logic SROIQ. This means that interpretations could evolve thanks to some actions such as addition and/or deletion of an element (respectively, a pair of elements) of a concept (respectively, of a role). The obtained logic is called SROIQ with explicit substitutions and is written SROIQ^σ. Substitution is not treated as meta-operation that is carried out immediately, but the operation of substitution may be delayed, so that sub-formulae of SROIQ^σ are of the form Φσ, where Φ is a SROIQ formula and σ is a substitution which encodes changes of concepts and roles. In this paper, we particularly prove that the satisfiability problem of SROIQ^σ is decidable.
READ FULL TEXT
