Skip to main content

Tableaux for Non-normal Public Announcement Logic

  • Conference paper
Logic and Its Applications (ICLA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8923))

Included in the following conference series:

Abstract

This paper presents a tableau calculus for two semantic interpretations of public announcements over monotone neighbourhood models: the intersection and the subset semantics, developed by Ma and Sano. We show that both calculi are sound and complete with respect to their corresponding semantic interpretations and, moreover, we establish that the satisfiability problem of this public announcement extensions is NP-complete in both cases. The tableau calculi has been implemented in Lotrecscheme.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aucher, G., Schwarzentruber, F.: On the complexity of dynamic epistemic logic. CoRR, abs/1310.6406 (2013)

    Google Scholar 

  2. Balbiani, P., van Ditmarsch, H.P., Herzig, A., DeLima, T.: A tableau method for public announcement logics. In: Olivetti, N. (ed.) TABLEAUX 2007. LNCS (LNAI), vol. 4548, pp. 43–59. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Baltag, A., Moss, L., Solecki, S.: The logic of public announcements, common knowledge and private suspicions. In: Proceedings of TARK, pp. 43–56. Morgan Kaufmann Publishers (1998)

    Google Scholar 

  4. Chellas, B.F.: Modal Logic: An Introduction. Cambridge University Press, Cambridge (1980)

    Book  MATH  Google Scholar 

  5. Fagin, R., Halpern, J.Y.: Belief, awareness, and limited reasoning. Artificial Intelligence 34(1), 39–76 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  6. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about knowledge. The MIT Press, Cambridge (1995)

    Google Scholar 

  7. Gerbrandy, J., Groeneveld, W.: Reasoning about information change. Journal of Logic, Language, and Information 6(2), 147–196 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. Governatori, G., Luppi, A.: Labelled tableaux for non-normal modal logics. In: Lamma, E., Mello, P. (eds.) AI*IA 1999. LNCS (LNAI), vol. 1792, pp. 119–130. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  9. Grossi, D., Roy, O., Huang, H. (eds.): LORI. LNCS, vol. 8196. Springer, Heidelberg (2013)

    MATH  Google Scholar 

  10. Halpern, J.Y., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artif. Intell. 54(2), 319–379 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  11. Halpern, J.Y., Rêgo, L.C.: Characterizing the np-pspace gap in the satisfiability problem for modal logic. J. Log. Comput. 17(4), 795–806 (2007)

    Article  MATH  Google Scholar 

  12. Hintikka, J.: Knowledge and Belief. Cornell University Press, Ithaca (1962)

    Google Scholar 

  13. Holliday, W.H., Hoshi, T., Icard III, T.F.: Schematic validity in dynamic epistemic logic: Decidability. In: van Ditmarsch, H., Lang, J., Ju, S. (eds.) LORI 2011. LNCS, vol. 6953, pp. 87–96. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. Holliday, W.H., Icard, T.F.: Moorean phenomena in epistemic logic. In: Beklemishev, L., Goranko, V., Shehtman, V. (eds.) Advances in Modal Logic, pp. 178–199. College Publications (2010)

    Google Scholar 

  15. Indrzejczak, A.: Labelled tableau calculi for weak modal logics. Bulletin of the Section of Logic 36(3/4), 159–171 (2007)

    MATH  MathSciNet  Google Scholar 

  16. Kripke, S.A.: Semantical analysis of modal logic II. non-normal modal propositional calculi. In: Symposium on the Theory of Models. North-Holland Publ. Co., Amsterdam (1965)

    Google Scholar 

  17. Ma, M., Sano, K.: How to update neighborhood models. In Grossi et al. [9], pp. 204–217

    Google Scholar 

  18. Montague, R.: Universal grammar. Theoria 36(3), 373–398 (1970)

    Article  MathSciNet  Google Scholar 

  19. Pacuit, E.: Neighborhood Semantics for Modal Logic. An Introduction, Lecture notes for the ESSLLI course A Course on Neighborhood Structures for Modal Logic (2007)

    Google Scholar 

  20. Papadimitriou, C.H.: Computational complexity. Addison-Wesley (1994)

    Google Scholar 

  21. Plaza, J.: Logics of public communications. Synthese 158(2), 165–179 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  22. Schwarzentruber, F.: Lotrecscheme. Electr. Notes Theor. Comput. Sci. 278, 187–199 (2011)

    Article  MathSciNet  Google Scholar 

  23. Scott, D.: Advice in modal logic. In: Lambert, K. (ed.) Philosophical Problems in Logic, pp. 143–173. Reidel, Dordrecht (1970)

    Chapter  Google Scholar 

  24. van Benthem, J.: Open problems in logical dynamics. In: Gabbay, D., Goncharov, S.S., Zakharyaschev, M. (eds.) Mathematical Problems from Applied Logic I. International Mathematical Series, vol. 4, pp. 137–192. Springer, New York (2006)

    Chapter  Google Scholar 

  25. van Benthem, J.: Logical Dynamics of Information and Interaction. Cambridge University Press (2011)

    Google Scholar 

  26. van Benthem, J., Pacuit, E.: Dynamic logics of evidence-based beliefs. Studia Logica 99(1), 61–92 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  27. van Ditmarsch, H., Kooi, B., van der Hoek, W.: Dynamic Epistemic Logic. Springer (2007)

    Google Scholar 

  28. van Ditmarsch, H., Kooi, B.P.: The secret of my success. Synthese 151(2), 201–232 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  29. Vardi, M.Y.: On the complexity of epistemic reasoning. In: Proceedings of the Fourth Annual IEEE, Symposium on Logic in Computer Science (LICS 1989), pp. 243–252 (1989)

    Google Scholar 

  30. Velázquez-Quesada, F.R.: Explicit and implicit knowledge in neighbourhood models. In: Grossi et al. [9], pp. 239–252

    Google Scholar 

  31. Zvesper, J.A.: Playing with Information. PhD thesis, Institute for Logic, Language and Computation, Universiteit van Amsterdam (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ma, M., Sano, K., Schwarzentruber, F., Velázquez-Quesada, F.R. (2015). Tableaux for Non-normal Public Announcement Logic. In: Banerjee, M., Krishna, S.N. (eds) Logic and Its Applications. ICLA 2015. Lecture Notes in Computer Science, vol 8923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45824-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-45824-2_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-45823-5

  • Online ISBN: 978-3-662-45824-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics