Translating General Game Descriptions into an Action Language | SpringerLink
Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6565))

Abstract

The game description language (GDL), which is the basis for the grand AI challenge of general game playing, can be viewed as yet another action language. However, due to its unique way of addressing the frame problem, GDL turned out to be surprisingly difficult to relate to any of the classical action formalisms. In this paper, we present the first complete embedding of GDL into an existing member, known as, \(\cal C\!\)+, of the family of action languages. Our provably correct translation paves the way for applying known results from reasoning about actions, including competitive implementations such as the Causal Calculator, to the new and ambitious challenge of general game playing.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. Akman, V., Erdogan, S., Lee, J., Lifschitz, V., Turner, H.: Representing the Zoo world and the Traffic world in the language of the Causal Calculator. Artificial Intelligence 153(1-2), 105–140 (2004)

    Article  MATH  Google Scholar 

  2. Apt, K., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, ch. 2, pp. 89–148. Morgan Kaufmann, San Francisco (1987)

    Google Scholar 

  3. Apt, K., Bol, R.: Logic programming and negation: A survey. Journal of Logic Programming 19/20, 9–71 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293–322. Plenum Press, New York (1978)

    Chapter  Google Scholar 

  5. Clune, J.: Heuristic evaluation functions for general game playing. In: Proceedings of the AAAI Conference, pp. 1134–1139 (2007)

    Google Scholar 

  6. Finnsson, H., Björnsson, Y.: Simulation-based approach to general game playing. In: Proceedings of the AAAI Conference, pp. 259–264 (2008)

    Google Scholar 

  7. Gelfond, M.: Answer sets. In: van Harmelen, F., Lifschitz, V., Porter, B. (eds.) Handbook of Knowledge Representation, pp. 285–316. Elsevier, Amsterdam (2008)

    Chapter  Google Scholar 

  8. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the International Joint Conference and Symposium on Logic Programming (IJCSLP), pp. 1070–1080 (1988)

    Google Scholar 

  9. Gelfond, M., Lifschitz, V.: Representing action and change by logic programs. Journal of Logic Programming 17, 301–321 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  10. Genesereth, M., Love, N., Pell, B.: General game playing: Overview of the AAAI competition. AI Magazine 26(2), 62–72 (2005)

    Google Scholar 

  11. Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic causal theories. Artificial Intelligence 153(1-2), 49–104 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kuhlmann, G., Dresner, K., Stone, P.: Automatic heuristic construction in a complete general game player. In: Proceedings of the AAAI Conference, pp. 1457–1462 (2006)

    Google Scholar 

  13. Lloyd, J., Topor, R.: A basis for deductive database systems II. Journal of Logic Programming 3(1), 55–67 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  14. Love, N., Hinrichs, T., Haley, D., Schkufza, E., Genesereth, M.: General Game Playing: Game Description Language Specification. Technical Report LG–2006–01, Computer Science Department, Stanford University (2006), games.stanford.edu

  15. McCarthy, J.: Situations and Actions and Causal Laws. Stanford Artificial Intelligence Project, Memo 2, Stanford University (1963)

    Google Scholar 

  16. McCarthy, J., Hayes, P.: Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence 4, 463–502 (1969)

    MATH  Google Scholar 

  17. Przymusinski, T.: On the declarative semantics of deductive databases and logic programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 193–216. Morgan Kaufmann, San Francisco (1988)

    Chapter  Google Scholar 

  18. Schiffel, S., Thielscher, M.: Fluxplayer: A successful general game player. In: Proceedings of the AAAI Conference, pp. 1191–1196 (2007)

    Google Scholar 

  19. Schiffel, S., Thielscher, M.: Automated theorem proving for general game playing. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 911–916 (2009)

    Google Scholar 

  20. Schiffel, S., Thielscher, M.: A multiagent semantics for the Game Description Language. In: Filipe, J., Fred, A., Sharp, B. (eds.) Agents and Artificial Intelligence: Proceedings of ICAART. CCIS, vol. 67, pp. 44–55. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  21. Schiffel, S., Thielscher, M., Zhao, D.: Decomposition of multi-player games. In: Nicholson, A., Li, X. (eds.) AI 2009. LNCS, vol. 5866, pp. 475–484. Springer, Heidelberg (2009)

    Google Scholar 

  22. Thielscher, M.: A general game description language for incomplete information games. In: Proceedings of the AAAI Conference, pp. 994–999 (2010)

    Google Scholar 

  23. Thielscher, M., Voigt, S.: A temporal proof system for general game playing. In: Proceedings of the AAAI Conference, pp. 1000–1005 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Thielscher, M. (2011). Translating General Game Descriptions into an Action Language. In: Balduccini, M., Son, T.C. (eds) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. Lecture Notes in Computer Science(), vol 6565. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20832-4_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20832-4_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20831-7

  • Online ISBN: 978-3-642-20832-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics