Get our free extension to see links to code for papers anywhere online!Free add-on: code for papers everywhere!Free add-on: See code for papers anywhere!
Add to Chrome
Add to Firefox
Add to EdgeA Resolution Calculus for Dynamic Semantics
Paper and Code
Sep 21, 2000
This paper applies resolution theorem proving to natural language semantics. The aim is to circumvent the computational complexity triggered by natural language ambiguities like pronoun binding, by interleaving pronoun binding with resolution deduction. Therefore disambiguation is only applied to expression that actually occur during derivations.
* In: J. Dix, L. Farinas del Cerro, and U. Furbach (eds.) Logics in
Artificial Intelligence (JELIA'98). Lecture Notes in Artificial Intelligence
1489, Springer, 1998, pp. 184-198 * 15 pages
View paper on