Put my galakmid Coin into the dispenser and kick it: Computational linguistics and theorem proving in a computer game [Book Review]

Journal of Logic, Language and Information 13 (2):187-206 (2004)
  Copy   BIBTEX


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.



    Upload a copy of this work     Papers currently archived: 77,670

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Identity in modal logic theorem proving.Francis J. Pelletier - 1993 - Studia Logica 52 (2):291 - 308.
Automation in Language Translation and Theorem Proving.P. Braffort & F. van Scheepen (eds.) - 1968 - Brussels, Commission of the European Communities, Directorate-General for Dissemination of Information.
Symbolic Logic and Mechanical Theorem Proving.Chin-Liang Chang - 1973 - New York, NY, USA: Academic Press.
Computational semantics in discourse: Underspecification, resolution, and inference.Johan Bos - 2004 - Journal of Logic, Language and Information 13 (2):139-157.
Mathematical Logic.Ian Chiswell - 2007 - Oxford, England: Oxford University Press.


Added to PP

59 (#206,463)

6 months
1 (#481,005)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references