Put My Galakmid Coin into the Dispenser and Kick It: Computational Linguistics and Theorem Proving in a Computer Game


We combine state-of-the-art techniques from computational linguisticsand theorem proving to build an engine for playing text adventures,computer games with which the player interacts purely through naturallanguage. The system employs a parser for dependency grammar and ageneration system based on TAG, and has components for resolving andgenerating referring expressions. Most of these modules make heavy useof inferences offered by a modern theorem prover for descriptionlogic. Our game engine solves some problems inherent in classical textadventures, and is an interesting test case for the interactionbetween natural language processing and inference.

This is a preview of subscription content, access via your institution.


  1. Dale, R. and Haddock, N., 1991, “Generating referring expressions involving relations,” pp. 161-166 in Proceedings of the 5th EACL.

  2. Dale, R. and Reiter, E., 1995, “Computational interpretations of the Gricean maxims in the generation of referring expressions,” Cognitive Science 18, 233-263.

    Google Scholar 

  3. Duchier, D., 2001, “Lexicalized syntax and topology for non-projective dependency grammar,” in Eighth Meeting on Mathematics of Language.

  4. Duchier, D., 2002, “Configuration of labeled trees under lexicalized constraints and principles,” Research on Language and Computation, to appear.

  5. Duchier, D. and Debusmann, R., 2001, “Topological dependency trees: A constraint-based account of linear precedence,” pp. 180-187 in Proceedings of the 39th ACL.

  6. Dyte, D., 1997, “A bear's night out,” Text adventure. Available at http://www.covehurst.net/ddyte/abno/

  7. Fikes, R.E., Hart, P.E., and Nilsson, N.J., 1972, “Learning and executing generalized robot plans,” Artificial Intelligence 3, 251-288.

    Google Scholar 

  8. Gabsdil, M., Koller, A., and Striegnitz, K., 2001, “Playing with description logic,” in Proceedings of the Second Workshop on Methods for Modalities (Application Description), Amsterdam.

  9. Gabsdil, M., Koller, A., and Striegnitz, K., 2002, “Natural language and inference in a computer game,” pp. 294-300 in Proceedings of COLING, Taipei.

  10. Haarslev, V. and Möller, R., 2001, “RACER system description,” pp. 701-705 in Proceedings of IJCAR-01, R. Goré, A. Leitsch, and T. Nipkow, eds., Berlin: Springer-Verlag.

    Google Scholar 

  11. Haarslev, V. and Möller, R., 2002, “Optimization strategies for instance retrieval,” in Proceedings of the International Workshop on Description Logics, Toulouse, France.

  12. Horrocks, I., Sattler, U., and Tobies, S., 1999, “Practical reasoning for expressive description logics,” pp. 161-180 in Proceedings of LPAR'99, H. Ganzinger, D. McAllester, and A. Voronkov, eds., Berlin: Springer-Verlag.

    Google Scholar 

  13. Koller, A. and Striegnitz, K., 2002, “Generation as dependency parsing,” pp. 17-24 in Proceedings of ACL-02, Philadelphia.

  14. Mozart Consortium, 1999, “The Mozart Programming System web pages,” http://www.mozartoz.org/

  15. Strube, M., 1998, “Never look back: An alternative to centering,” pp. 1251-1257 in COLING-ACL.

  16. Tobies, S., 2000, “The complexity of reasoning with cardinality restrictions and nominals in expressive description logics,” Journal of Artificial Intelligence Research 12, 199-217.

    Google Scholar 

  17. Woods, W. and Schmolze, J., 1992, “The KL-ONE family,” Computer and Mathematics with Applications 23.

Download references

Author information



Rights and permissions

Reprints and Permissions

About this article

Cite this article

Koller, A., Debusmann, R., Gabsdil, M. et al. Put My Galakmid Coin into the Dispenser and Kick It: Computational Linguistics and Theorem Proving in a Computer Game. Journal of Logic, Language and Information 13, 187–206 (2004). https://doi.org/10.1023/B:JLLI.0000024734.80591.30

Download citation

  • dependency grammar
  • description logic
  • generation
  • parsing
  • reference resolution
  • text adventures
  • theorem provers