A Tableau Calculus for Pronoun Resolution

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.descriptionWe present a tableau calculus for reasoning in fragments of natural language. We focus on the problem of pronoun resolution and the way in which it complicates automated theorem proving for natural language processing. A method for explicitly manipulating contextual information during deduction is proposed, where pronouns are resolved against this context during deduction. As a result, pronoun resolution and deduction can be interleaved in such a way that pronouns are only resolved if this is licensed by a deduction rule; this helps us to avoid the combinatorial complexity of total pronoun disambiguation.
dc.description16 pages
dc.identifierhttps://arxiv.org/abs/cs/0009017
dc.identifierhttp://arxiv.org/abs/cs/0009017
dc.identifierIn: N.V. Murray (ed.) Automated Reasoning with Analytic Tableaux and Related Methods. Lecture Notes in Artificial Intelligence 1617, Springer, 1999, pages 247-262
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30398
dc.subjectComputation and Language
dc.subjectArtificial Intelligence
dc.subjectF.4.1; I.2.7
dc.titleA Tableau Calculus for Pronoun Resolution
dc.typetext

Files

Collections

arXiv