A Resolution Calculus for Dynamic Semantics

Simple item page
dc.creatorMonz, Christof
dc.creatorde Rijke, Maarten
dc.date2000-09-21
dc.date.accessioned2026-07-07T03:16:34Z
dc.date.available2026-07-07T03:16:34Z
dc.descriptionThis 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.
dc.description15 pages
dc.identifierhttps://arxiv.org/abs/cs/0009018
dc.identifierhttp://arxiv.org/abs/cs/0009018
dc.identifierIn: 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
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30399
dc.subjectComputation and Language
dc.subjectArtificial Intelligence
dc.subjectF.4.1; I.2.7
dc.titleA Resolution Calculus for Dynamic Semantics
dc.typetext

Files

Collections

arXiv