Characterizing right inverses for spatial constraint systems with applications to modal logic

Michell Guzmán, Salim Perchy, Camilo Rueda, Frank D. Valencia

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

Spatial constraint systems are algebraic structures from concurrent constraint programming to specify spatial and epistemic behavior in multi-agent systems. In this paper spatial constraint systems are used 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, a necessary and sufficient condition for the existence of right inverses is identified and the abstract notion of normality is shown to correspond to the preservation of finite suprema. Furthermore, a taxonomy of normal right inverses is provided, identifying the greatest normal right inverse as well as the complete family of minimal right inverses. These results are applied to existing modal languages such as the weakest normal modal logic, Hennessy–Milner logic, and linear-time temporal logic. Some implications of these results are also discussed in the context of modal concepts such as bisimilarity and inconsistency invariance.

Original languageEnglish
Pages (from-to)56-77
Number of pages22
JournalTheoretical Computer Science
Volume744
DOIs
StatePublished - 05 Oct 2018

Keywords

  • Concurrency theory
  • Concurrent constraint programming
  • Constraint systems
  • Inverse operators
  • Modal logic

Fingerprint

Dive into the research topics of 'Characterizing right inverses for spatial constraint systems with applications to modal logic'. Together they form a unique fingerprint.

Cite this