Skip to main content

Embedding Coalition Logic in the Minimal Normal Multimodal Logic with Intersection

  • Chapter
  • First Online:
Modality, Semantics and Interpretations

Part of the book series: Logic in Asia: Studia Logica Library ((LIAA))

Abstract

We present a satisfiability-preserving embedding of coalition logic into a normal modal logic. An advantage of standard, normal, and modal logics is a well-understood theoretical foundation and the availability of tools for automated verification and reasoning. The target logic is multimodal K with intersection of modalities, interpreted over standard Kripke models corresponding to game structures. There is a restriction: we consider only game structures that are injective. We argue that this is a minor limitation, e.g., because coalition logic cannot discern between injective and non-injective game structures. We give a complete axiomatization of the corresponding models, as well as a characterization of key complexity problems. We also prove a representation theorem identifying the effectivity functions corresponding to injective games.

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 EPUB and 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
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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.

    We are using cl rather than atl syntax here for clarity.

References

  1. van der Hoek, W., Pauly, M.: Modal logic for games and information. In: J. van Benthem, P. Blackburn, F. Wolter (eds.) The Handbook of Modal Logic, pp. 1180–1152. Elsevier, Amsterdam, The Netherlands (2006)

    Google Scholar 

  2. Pauly, M.: A modal logic for coalitional power in games. Journal of Logic and Computation 12(1), 149–166 (2002)

    Google Scholar 

  3. Alur, R.,Henzinger, T.A.,Kupferman,O.: Alternating-time temporal logic. Journal of the ACM 49, 672–713 (2002)

    Google Scholar 

  4. van Benthem, J.: Games in dynamic-epistemic logic. Bulletin of Economic Research 53(4), 219–248 (2001)

    Google Scholar 

  5. van Benthem, J.: Extensive games as process models. J. of Logic, Lang. and Inf. 11, 289–313 (2002)

    Google Scholar 

  6. Parikh, R.: Propositional logics of programs: New directions. In: Foundations of Computation Theory, pp. 347–359. Springer (1983)

    Google Scholar 

  7. Parikh, R.: The logic of games and its applications. In: M. Karplnski, J. van Leeuwen (eds.) Topics in the Theory of Computation Selected Papers of the International Conference on Foundations of Computation Theory, FCT ’83, North-Holland Mathematics Studies, vol. 102,pp. 111–139. North-Holland (1985)

    Google Scholar 

  8. Harel, D.: Dynamic logic. In: D. Gabbay, F. Guenthner (eds.) Handbook of Philosophical Logic, Volume II: Extensions of Classical Logic, Synthese Library, vol. 165, chap. II.10, pp. 497–604. D. Reidel Publishing Co., Dordrecht (1984)

    Google Scholar 

  9. van Benthem, J.: In praise of strategies. In: J. van Eijck, R. Verbrugge (eds.) Games, Actions and Social Software, Lecture Notes in Computer Science, vol. 7010, pp. 96–116. Springer, Berlin Heidelberg (2012)

    Google Scholar 

  10. Gargov, G., Passy, S.: A note on boolean modal logic. In: Mathematical Logic. Proc. of The Summer School and Conf. on Mathematical Logic “Heyting’88”, pp. 311–321. Plenum Press, New York (1988)

    Google Scholar 

  11. Lutz, C., Sattler, U.: The complexity of reasoning with boolean modal logics. In: F. Wolter, H. Wansing, M. de Rijke, M. Zakharyaschev (eds.) Advances in Modal Logic, vol. 3, pp. 329–348. World Scientific (2002)

    Google Scholar 

  12. Broersen, J., Herzig, A., Troquard, N.: A normal simulation of coalition logic and an epistemic extension. In: D. Samet (ed.) Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2007), Brussels, Belgium, June 25–27, 2007, pp. 92–101 (2007)

    Google Scholar 

  13. Lorini, E.: A dynamic logic of agency II: Deterministic DLA, coalition logic, and game theory. Journal of Logic, Language and Information 19, 327–351 (2010)

    Google Scholar 

  14. Goranko, V.: Coalition games and alternating temporal logics. In: Proceeding of the Eighth Conference on Theoretical Aspects of Rationality and Knowledge (TARK VIII, pp. 259–272. Morgan Kaufmann (2001)

    Google Scholar 

  15. Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press: Cambridge, MA (1994)

    Google Scholar 

  16. Goranko, V., Jamroga, W., Turrini, P.: Strategic games and truly playable effectivity functions. In: Tumer, Yolum, Sonenberg, Stone (eds.) Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), pp. 727–734. Taipei, Taiwan (2011)

    Google Scholar 

  17. Gasquet, O., Herzig, A.: Translating inaccessible worlds logic into bimodal logic. In: M. Clarke, R. Kruse, S. Moral (eds.) Symbolic and Quantitative Approaches to Reasoning and Uncertainty, Lecture Notes in Computer Science, vol. 747, pp. 145–150. Springer, Berlin Heidelberg (1993)

    Google Scholar 

  18. Kracht, M., Wolter, F.: Normal monomodal logics can simulate all others. The Journal of Symbolic Logic 64(1), pp. 99–138 (1999). URL http://www.jstor.org/stable/2586754

  19. Ågotnes, T., Alechina, N.: Reasoning about joint action and coalitional ability in \(K_n\) with intersection. In: J. Leite, P. Torroni, T. Ågotnes, G. Boella, L. van der Torre (eds.) Computational Logic in Multi-Agent Systems - 12th International Workshop (CLIMA XII, Proceedings, Lecture Notes in Computer Science, vol. 6814, pp. 139–156. Springer (2011)

    Google Scholar 

  20. Ågotnes, T., Goranko, V., Jamroga, W.: Alternating-time temporal logics with irrevocable strategies. In: D. Samet (ed.) Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK XI), pp. 15–24. Presses Universitaires de Louvain, Brussels, Belgium (2007)

    Google Scholar 

  21. Goranko, V., van Drimmelen, G.: Complete axiomatization and decidability of alternating-time temporal logic. Theor. Comput. Sci. 353(1–3), 93–117 (2006)

    Google Scholar 

  22. Lange, M.: Model checking propositional dynamic logic with all extras. J. Applied Logic 4(1), 39–49 (2006)

    Google Scholar 

  23. Belnap, N., Perloff, M.: Seeing to it that: a canonical form for agentives. Theoria 54, 175–199 (1988)

    Google Scholar 

  24. Danecki, S.: Nondeterministic propositional dynamic logic with intersection is decidable. In: A. Skowron (ed.) Proceedings of the 5th Symposium on Computation Theory, LNCS, vol. 208, pp. 34–53. Springer, Zaborów, Poland (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Thomas Ågotnes .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ågotnes, T., Alechina, N. (2015). Embedding Coalition Logic in the Minimal Normal Multimodal Logic with Intersection. In: Ju, S., Liu, H., Ono, H. (eds) Modality, Semantics and Interpretations. Logic in Asia: Studia Logica Library. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47197-5_1

Download citation

Publish with us

Policies and ethics