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. (shrink)

Slightly modified version, as it appeared in Striegnitz, K. et al. Special Issue: The Language Sections of the ESSLLI-01 Student Session, Human Language Technology Theses. 2002.