A Resolution Calculus for Dynamic Semantics

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
15 pages

Keywords

Computation and Language, Artificial Intelligence, F.4.1; I.2.7

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30399

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0009018
 http://arxiv.org/abs/cs/0009018
 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

Collections

arXiv