Abstract
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. To this end, disambiguation is only applied to expressions that actually occur during derivations. Given a set of premises and a conclusion, our resolution method only delivers pronoun bindings that are needed to derive the conclusion.
Cite
CITATION STYLE
Monz, C., & de Rijke, M. (1998). A resolution calculus for dynamic semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1489, pp. 184–198). Springer Verlag. https://doi.org/10.1007/3-540-49545-2_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
