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 (2):187-206 (2004)
|Abstract||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.|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Francis J. Pelletier (1993). Identity in Modal Logic Theorem Proving. Studia Logica 52 (2):291 - 308.
Ian Chiswell (2007). Mathematical Logic. Oxford University Press.
Johan Bos (2004). Computational Semantics in Discourse: Underspecification, Resolution, and Inference. Journal of Logic, Language and Information 13 (2):139-157.
N. Shankar (1994). Metamathematics, Machines, and Gödel's Proof. Cambridge University Press.
P. Braffort & F. van Scheepen (eds.) (1968). Automation in Language Translation and Theorem Proving. Brussels, Commission of the European Communities, Directorate-General for Dissemination of Information.
Patrick Blackburn (2005). Representation and Inference for Natural Language: A First Course in Computational Semantics. Center for the Study of Language and Information.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads7 ( #133,381 of 549,014 )
Recent downloads (6 months)1 ( #63,261 of 549,014 )
How can I increase my downloads?