Coalgebraic Announcement Logics
Author(s): Gorin D, Schröder L, Carreiro F
Title edited volumes: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publishing place: Berlin
Publication year: 2013
Title of series: Lecture Notes in Computer Science
Conference Proceedings Title: Proc. 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013, Part II
Pages range: 101-112
Event: 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013
Event location: Riga
Start date of the event: 08/07/2013
End date of the event: 12/07/2013
In epistemic logic, dynamic operators describe the evolution of the knowledge of participating agents through communication, one of the most basic forms of communication being public announcement. Semantically, dynamic operators correspond to transformations of the underlying model. While metatheoretic results on dynamic epistemic logic so far are largely limited to the setting of Kripke models, there is evident interest in extending its scope to non-relational modalities capturing, e.g., uncertainty or collaboration. We develop a generic framework for non-relational dynamic logic by adding dynamic operators to coalgebraic logic. We discuss a range of examples and establish basic results including bisimulation invariance, complexity, and a small model property. © 2013 Springer-Verlag.
FAU Authors / FAU Editors How to cite
APA: Gorin, D., Schröder, L., & Carreiro, F. (2013). Coalgebraic Announcement Logics. In Proc. 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013, Part II (pp. 101-112). Berlin: Springer-verlag.
MLA: Gorin, Daniel, Lutz Schröder, and Facundo Carreiro. "Coalgebraic Announcement Logics." Proceedings of the 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013, Riga Berlin: Springer-verlag, 2013. 101-112.