A Resolution Calculus for Dynamic Semantics

TL;DR

This paper introduces a resolution calculus tailored for dynamic semantics in natural language, aiming to efficiently handle ambiguities like pronoun binding by integrating disambiguation with deduction.

Contribution

It presents a novel resolution calculus that interleaves pronoun binding with deduction, reducing computational complexity in natural language semantics.

Findings

Effective handling of pronoun binding during resolution

Reduction in computational complexity for semantic deduction

Integration of disambiguation with resolution process

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.