This is a preview of subscription content,to check access.
Access this article
Aucher, G., and F. Schwarzentruber, On the complexity of dynamic epistemic logic, in Proceedings of TARK ’13, ACM Digital Library, 2013.
French, T., W. van der Hoek, P. Iliev, and B. P. Kooi, Succinctness of epistemic languages, in Proceedings of IJCAI ’11, 2011, pp. 881–886.
Halpern J.Y, Vardi M.Y.: The complexity of reasoning about knowledge and time. i. lower bounds. Journal of Computer and System Sciences 38(1), 195–237 (1989)
Holliday, W., T. Hoshi, and T. Icard, A uniform logic of information dynamics, in Proceedings of Advances in Modal Logic 2012, volume 9, College Publications, 2012, pp. 348–367.
Lutz, C., Complexity and succinctness of public announcement logic, in Proceedings of AAMAS ’06, New York, NY, USA, 2006, pp. 137–143. ACM.
van Benthem, J., J. Gerbrandy, T. Hoshi, and E. Pacuit, Merging frameworks for interaction, Journal of Philosophical Logic 38(5):491–526, October 2009.
Wang, Y., and Q. Cao, On axiomatizations of public announcement logic, Synthese 190 (1 Supplement):103–134, 2013.