A Tableau Calculus for Pronoun Resolution

09/21/2000
by   Christof Monz, et al.
0

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.

READ FULL TEXT
research
09/21/2000

A Resolution Calculus for Dynamic Semantics

This paper applies resolution theorem proving to natural language semant...
research
09/21/2000

Computing Presuppositions by Contextual Reasoning

This paper describes how automated deduction methods for natural languag...
research
08/13/2016

Undecidability of the Lambek calculus with subexponential and bracket modalities

The Lambek calculus is a well-known logical formalism for modelling natu...
research
09/20/2000

Contextual Inference in Computational Semantics

In this paper, an application of automated theorem proving techniques to...
research
09/16/2017

Data Innovation for International Development: An overview of natural language processing for qualitative data analysis

Availability, collection and access to quantitative data, as well as its...
research
03/05/2022

The Proof is in the Pudding: Using Automated Theorem Proving to Generate Cooking Recipes

This paper presents FASTFOOD, a rule-based Natural Language Generation P...
research
07/29/2019

Generating theorem proving procedures from axioms of Truncated Predicate Calculus

We present a novel approach to the problem of automated theorem proving....

Please sign up or login with your details

Forgot password? Click here to reset