Abstract
Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose a labelled tableau-calculus for this logic. We also present an extension of the calculus for a logic of arbitrary announcements.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Plaza, J.: Logics of public communications. In: Emrich, M.L., Hadzikadic, M., Pfeifer, M.S., Ras, Z.W. (eds.) Proceedings of ISMIS 1989, pp. 201–216 (1989)
Baltag, A., Moss, L., Solecki, S.: The logic of public announcements, common knowledge, and private suspicions. Technical Report SEN-R9922, Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands (1999)
Gerbrandy, J.: Bisimulations on Planet Kripke. PhD thesis, University of Amsterdam, Amsterdam, The Netherlands (1999)
Kooi, B.: Expressivity and completeness for public update logic via reduction axioms. Journal of Applied Non-Classical Logics (to appear, 2007)
van Benthem, J., van Eijck, J., Kooi, B.: Logics of communication and change. Information and Computation 204(11), 1620–1662 (2006)
van Ditmarsch, H., Kooi, B.: The secret of my success. Synthese 151, 201–232 (2006)
van Ditmarsch, H., van der Hoek, W., Kooi, B.: Playing cards with Hintikka. Australasian Journal of Logic 3, 108–134 (2005)
Herzig, A., De Lima, T.: Epistemic actions and ontic actions: A unified logical framework. In: Sichman, J.S., Coelho, H., Rezende, S.O. (eds.) IBERAMIA 2006 and SBIA 2006. LNCS (LNAI), vol. 4140, pp. 409–418. Springer, Heidelberg (2006)
Lutz, C.: Complexity and succintness of public announcement logic. In: Stone, P., Weiss, G. (eds.) Proceedings of AAMAS, 137–144 (2006)
Balbiani, P., Baltag, A., van Ditmarsch, H., Herzig, A., Hoshi, T., de Lima, T.: What can we achieve by arbitrary announcements? A dynamic take on Fitch’s knowability. In: Proceedings of TARK (to appear, 2007)
Fitting, M.: Proof Methods for Modal and Intuitionistic Logics. Reidel Publishing Company, Dordrecht (1983)
Halpern, J., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence 54, 311–379 (1992)
Smullyan, R.M.: First-Order Logic. Springer, Heidelberg (1968)
Letz, R.: Tableau methods for modal and temporal logics. In: D’Agostino, M., Gabbay, D., Hähnle, R., Possega, J. (eds.) Handbook of Tableau Methods, Kluwer Academic Publishers, Boston (1999)
de Boer, M.: Praktische bewijzen in public announcement logica (Practical proofs in public announcement logic). Master’s thesis, Department of Artificial Intelligence, University of Groningen, in Dutch (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balbiani, P., van Ditmarsch, H., Herzig, A., de Lima, T. (2007). A Tableau Method for Public Announcement Logics. In: Olivetti, N. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2007. Lecture Notes in Computer Science(), vol 4548. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73099-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-73099-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73098-9
Online ISBN: 978-3-540-73099-6
eBook Packages: Computer ScienceComputer Science (R0)