A Tableau Calculus for Pronoun Resolution

TL;DR

This paper introduces a tableau calculus that integrates pronoun resolution into logical deduction, improving natural language reasoning by handling pronouns contextually and efficiently, reducing combinatorial complexity.

Contribution

It proposes a novel tableau calculus that explicitly incorporates contextual information for pronoun resolution during deduction, advancing automated reasoning in natural language processing.

Findings

Effective integration of pronoun resolution with deduction.

Reduces combinatorial complexity in pronoun disambiguation.

Enables interleaved reasoning and resolution processes.

Abstract

We 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.