G. Aucher, DEL-sequents for progression, Journal of Applied Non-Classical Logics, vol.36, issue.6, pp.3-4289, 2011.
DOI : 10.3166/jancl.21.289-321
URL : https://hal.archives-ouvertes.fr/hal-00674150

. Aucher, Generalized DEL-Sequents, Lecture Notes in Computer Science, vol.278, issue.2, pp.54-66, 2012.
DOI : 10.1016/j.entcs.2011.10.015
URL : https://hal.archives-ouvertes.fr/hal-00856472

. Balbiani, Tableaux for Public Announcement Logic, Journal of Logic and Computation, vol.20, issue.1, pp.55-76, 2010.
DOI : 10.1093/logcom/exn060

. Baltag, Epistemic Actions as Resources, Journal of Logic and Computation, vol.17, issue.3, pp.555-585, 2007.
DOI : 10.1093/logcom/exm015

A. Baltag and L. Moss, Logics for Epistemic Programs, Synthese, vol.139, issue.2, pp.165-224, 2004.
DOI : 10.1023/B:SYNT.0000024912.56773.5e

. Baltag, The Logic of Public Announcements, Common Knowledge, and Private Suspicions, Proceedings of TARK98, pp.43-56, 1998.
DOI : 10.1007/978-3-319-20451-2_38

. Baltag, The Logic of Public Announcements, Common Knowledge, and Private Suspicions, 1999.
DOI : 10.1007/978-3-319-20451-2_38

P. Boas, The convenience of tilings, Complexity, Logic, and Recursion Theory, pp.331-363, 1997.

. De-boer, KE tableaux for public anouncement logic, Proceedings of FAMAS 07, 2007.

. Fagin, Reasoning about knowledge, 1995.

. French, Succinctness of epistemic languages, IJCAI, pp.881-886, 2011.

J. Hansen, Terminating Tableaux for Dynamic Epistemic Logics, Electronic Notes in Theoretical Computer Science, vol.262, pp.141-156, 2010.
DOI : 10.1016/j.entcs.2010.04.011
URL : http://doi.org/10.1016/j.entcs.2010.04.011

. Harel, Dynamic Logic, 2000.

C. Lutz, Complexity and succinctness of public announcement logic, Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems , AAMAS '06, pp.137-143, 2006.
DOI : 10.1145/1160633.1160657

. Miller, . Moss, J. Miller, and L. Moss, The Undecidability of Iterated Modal Relativization, Studia Logica, vol.82, issue.4, pp.373-407, 2005.
DOI : 10.1007/s11225-005-3612-9

C. H. Papadimitriou, Computational complexity, 1995.

J. Plaza, Logics of public communications, Proceedings of the 4th International Symposium on Methodologies for Intelligent Systems, pp.201-216, 1989.
DOI : 10.1007/s11229-007-9168-7

S. Richards and M. Sadrzadeh, Aximo: Automated Axiomatic Reasoning for Information Update, Electronic Notes in Theoretical Computer Science, vol.231, pp.211-225, 2009.
DOI : 10.1016/j.entcs.2009.02.037
URL : http://doi.org/10.1016/j.entcs.2009.02.037

F. Schwarzentruber, LotrecScheme, Electronic Notes in Theoretical Computer Science, vol.278, pp.187-199, 2011.
DOI : 10.1016/j.entcs.2011.10.015
URL : http://doi.org/10.1016/j.entcs.2011.10.015

. Van-benthem, . Kooi, J. Van-benthem, and B. Kooi, Reduction axioms for epistemic actions, AiML-2004: Advances in Modal Logic, number UMCS-04-9-1 in Technical Report Series, pp.197-211, 2004.

D. Van, Dynamic Epistemic Logic, volume 337 of Synthese library, 2007.

D. Van, Model checking sum and product, Australian Conference on Artificial Intelligence, pp.790-795, 2005.

D. Van, Model checking russian cards, Electr. Notes Theor. Comput. Sci, vol.149, issue.2, pp.105-123, 2006.

. Van-eijck and J. Van-eijck, Demo ? a demo of epistemic modelling, Interactive Logic ? Proceedings of the 7th Augustus de Morgan Workshop, Texts in Logic and Games 1, pp.305-363, 2007.

E. Van, . Orzan, J. Van-eijck, and S. Orzan, Epistemic verification of anonymity, Electronic Notes in Theoretical Computer Science, vol.168, issue.0, pp.159-174, 2007.