Skip to main content

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 179))

  • 807 Accesses

Abstract

This article investigates a communication logic based on the multi-modal logic S5n, and it is treated from multi-modal logical point of view. We introduce models for the logic as knowledge revision processes on agents’ knowledge by communication through messages, and the completeness theorem is shown: the communication logic is determined by the class of all the models.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Notes

  1. 1.

    There exists a time \(m\) such that for all \(t\), \(\Pr (t) = \Pr (t+m)\). The period of the protocol is the minimal number of all \(m\) such that for every \(t\), \(\Pr (t+m) = \Pr (t)\).

References

  1. Aumann, R.J.: Agreeing to disagree. Ann. Stat. 4, 1236–1239 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  2. Aumann, R.J., Brandenburger, A.: Epistemic conditions for mixed strategy Nash equilibrium. Econometrica 63, 1161–1180 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chellas, B.F.: Modal logic: An introduction. Cambridge University Press, Cambridge (1980)

    Book  MATH  Google Scholar 

  4. Krasucki, P.: Protocol forcing consensus. J. Econ. Theor. 70, 266–272 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Matsuhisa, T.: Communication leading to Nash equilibrium through robust messages: S5-knowledge model case. Combinatorial optimization and applications, Lecture Notes in Computer Science 4616. pp. 136–145. Springer, Berlin (2007)

    Google Scholar 

  6. Matsuhisa, T.: Fuzzy communication reaching consensus under acyclic condition. PRICAI 2008: Trends in Artificial Intelligence, Proceedings, Lecture Notes in Computer Science 5351. pp. 760–767. Springer, Berlin (2007)

    Google Scholar 

  7. Matsuhisa, T.: Moral hazard resolved by common-knowledge in principal-agent model. Int. J. Intell. Inform. Database Syst. 6(3) pp. 220–230 (2012)

    Google Scholar 

  8. Matsuhisa, T., Jiang, D.Y.: Moral hazard resolved in communication network. World J. Soc Sci. 1(3) pp. 100–115 (2011)

    Google Scholar 

  9. Matsuhisa, T., Strokan, P.: Bayesian communication leading to a Nash equilibrium. Int. J. Math. Game Theor. Algebra 18(4–5), 427–434 (2009)

    Google Scholar 

  10. Parikh, R., Krasucki, P.: Communication, consensus, and knowledge. J. Econ. Theor. 52, 178–189 (1990)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The research was supported by Grant-in-Aid for Scientific Research (C) (No. 23540178) in the Japan Society for the Promotion of Sciences and it was also supported by the BUSAIKU-BUHI Foundation for Scientific Researches.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Takashi Matsuhisa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matsuhisa, T. (2013). Communication Logic on Multi-Modal Logic S5n. In: Kudělka, M., Pokorný, J., Snášel, V., Abraham, A. (eds) Proceedings of the Third International Conference on Intelligent Human Computer Interaction (IHCI 2011), Prague, Czech Republic, August, 2011. Advances in Intelligent Systems and Computing, vol 179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31603-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31603-6_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31602-9

  • Online ISBN: 978-3-642-31603-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics