A Resolution Calculus for Dynamic Semantics

2000/09/21 by Christof Monz, Maarten de Rijke
Computer Science · #cs.CL #cs.AI

paper · pdf

published as 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

arxiv created 2000/09/21 · arxiv updated 2009/11/30

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. Therefore disambiguation is only applied to expression that actually occur during derivations.

Related

• A Tableau Calculus for Pronoun Resolution
• Resolution in Linguistic First Order Logic based on Linear Symmetrical Hedge Algebra
• Conflict Resolution: a First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning
• An Algorithm to Co-Ordinate Anaphora Resolution and PPS Disambiguation\n Process
• Resolution in Linguistic Propositional Logic based on Linear Symmetrical\n Hedge Algebra