المساق
arXiv 2014-06-24 0 مشاهدة

SROIQsigma is decidable

Brenas, Jon Haël · Echahed, Rachid · Strecker, Martin

الأصل · EN

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.

الترجمة العربية

لا توجد ترجمة عربية لهذا البحث بعد. كن أوّل من يطلبها: تستغرق ثوانيَ معدودة، وتُحفظ النتيجة لكل قارئ قادم.

تحقّق أمني

اكتب الأحرف الظاهرة أعلاه

حتى 10 ترجمات لكل شخص يومياً.