Bisimulation through probabilistic testing
Information and Computation
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Reasoning about knowledge and probability
Journal of the ACM (JACM)
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Theoretical Computer Science
Complexity and succinctness of public announcement logic
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Dynamic Epistemic Logic
Coalgebraic epistemic update without change of model
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
Mathematical Structures in Computer Science
Coalgebraic correspondence theory
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Succinctness of epistemic languages
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
| Hi-index | 0.00 |
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.