Abstract
Bisimulations are a key notion to study the expressive power of a modal language. This paper studies the expressiveness of Game Description Language (GDL) and its epistemic extension EGDL through a bisimulations approach. We first define a notion of bisimulation for GDL and prove that it coincides with the indistinguishability of GDL-formulas. Based on it, we establish a characterization of the definability of GDL in terms of k-bisimulations. Then we define a novel notion of bisimulation for EGDL, and obtain a characterization of the expressive power of EGDL. In particular, we show that a special case of the bisimulation for EGDL can be used to characterize the expressivity of GDL. These characterizations not only justify the notions of bisimulation are appropriate for game description languages, but also provide a powerful tool to identify their expressive power.
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
References
Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672–713 (2002)
van Benthem, J.: Modal correspondence theory. Ph.D. thesis, University of Amsterdam (1977)
van Benthem, J.: Correspondence theory. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic. Synthese Library (Studies in Epistemology, Logic, Methodology, and Philosophy of Science), vol. 165, pp. 167–247. Springer, Dordrecht (1984). https://doi.org/10.1007/978-94-009-6259-0_4
van Benthem, J., Bezhanishvili, N., Enqvist, S.: A new game equivalence and its modal logic. In: Proceedings Sixteenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2017), pp. 57–74 (2017)
Blackburn, P., De Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2002)
Blackburn, P., van Benthem, J., Wolter, F.: Handbook of Modal Logic, vol. 3. Elsevier, Amsterdam (2006)
Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy logic. Inf. Comput. 208(6), 677–693 (2010)
Genesereth, M., Love, N., Pell, B.: General game playing: overview of the AAAI competition. AI Mag. 26(2), 62–72 (2005)
Goranko, V.: The basic algebra of game equivalences. Stud. Logica 75(2), 221–238 (2003)
Grädel, E., Otto, M.: The freedoms of (guarded) bisimulation. In: Baltag, A., Smets, S. (eds.) Johan van Benthem on Logic and Information Dynamics. OCL, vol. 5, pp. 3–31. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-06025-5_1
Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. ACM (JACM) 32(1), 137–161 (1985)
Jiang, G., Zhang, D., Perrussel, L., Zhang, H.: Epistemic GDL: a logic for representing and reasoning about imperfect information games. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pp. 1138–1144 (2016)
Lorini, E., Schwarzentruber, F.: A path in the jungle of logics for multi-agent system: on the relation between general game-playing logics and seeing-to-it-that logics. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2017), pp. 687–695 (2017)
Love, N., Hinrichs, T., Haley, D., Schkufza, E., Genesereth, M.: General game playing: game description language specification. Stanford Logic Group Computer Science Department Stanford University (2006). http://logic.stanford.edu/reports/LG-2006-01.pdf
Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167–183. Springer, Heidelberg (1981). https://doi.org/10.1007/BFb0017309
Pauly, M.: Logic for social software. Ph.D. thesis, University of Amsterdam (2001). ILLC Dissertation Series 2001-10
Reiter, R.: The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression. Artif. Intell. Math. Theory Comput. Pap. Honor John McCarthy 27, 359–380 (1991)
Ruan, J., van Der Hoek, W., Wooldridge, M.: Verification of games in the game description language. J. Logic Comput. 19(6), 1127–1156 (2009)
Thielscher, M.: A general game description language for incomplete information games. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 994–999 (2010)
Thielscher, M.: GDL-III: a description language for epistemic general game playing. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pp. 1276–1282 (2017)
Zhang, D., Thielscher, M.: Representing and reasoning about game strategies. J. Philos. Logic 44(2), 203–236 (2015)
Zhang, H., Liu, D., Li, W.: Space-consistent game equivalence detection in general game playing. In: Cazenave, T., Winands, M.H.M., Edelkamp, S., Schiffel, S., Thielscher, M., Togelius, J. (eds.) CGW/GIGA -2015. CCIS, vol. 614, pp. 165–177. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-39402-2_12
Acknowledgments
Guifei Jiang acknowledges the support of the National Natural Science Foundation of China (No. 61806102), the Fundamental Research Funds for the Central Universities, and the Major Program of the National Social Science Foundation of China (No. 17ZDA026). Laurent Perrussel acknowledges the support of the ANR project AGAPE ANR-18-CE23-0013.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Jiang, G., Perrussel, L., Zhang, D., Zhang, H., Zhang, Y. (2019). Characterizing the Expressivity of Game Description Languages. In: Nayak, A., Sharma, A. (eds) PRICAI 2019: Trends in Artificial Intelligence. PRICAI 2019. Lecture Notes in Computer Science(), vol 11670. Springer, Cham. https://doi.org/10.1007/978-3-030-29908-8_47
Download citation
DOI: https://doi.org/10.1007/978-3-030-29908-8_47
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-29907-1
Online ISBN: 978-3-030-29908-8
eBook Packages: Computer ScienceComputer Science (R0)