Deriving Inverse Operators for Modal Logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Deriving Inverse Operators for Modal Logic


Spatial constraint systems are algebraic structures from concurrent constraint programming to specify spatial and epistemic behavior in multi-agent systems. We shall use spatial constraint systems to give an abstract characterization of the notion of normality in modal logic and to derive right inverse/reverse operators for modal languages. In particular, we shall identify the weakest condition for the existence of right inverses and show that the abstract notion of normality corresponds to the preservation of finite suprema. We shall apply our results to existing modal languages such as the weakest normal modal logic, Hennessy-Milner logic, and linear-time temporal logic. We shall discuss our results in the context of modal concepts such as bisimilarity and inconsistency invariance.
Fichier principal
Vignette du fichier
main.pdf (307.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01328188 , version 1 (07-06-2016)
hal-01328188 , version 2 (21-10-2016)





Michell Guzman, Salim Perchy, Camilo Rueda, Frank Valencia. Deriving Inverse Operators for Modal Logic. Theoretical Aspects of Computing – ICTAC 2016, Oct 2016, Taipei, Taiwan. pp.214-232, ⟨10.1007/978-3-319-46750-4_13⟩. ⟨hal-01328188v2⟩
487 View
358 Download



Gmail Facebook Twitter LinkedIn More