3 papers
cs.CL2000
A Resolution Calculus for Dynamic Semantics
Christof Monz, Maarten de Rijke
This paper applies resolution theorem proving to natural language semantics. The aim is to circumvent the computational complexity triggered by natural language ambiguities like pr…
cs.CL2000
A Tableau Calculus for Pronoun Resolution
Christof Monz, Maarten de Rijke
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 pr…
cs.CL2000
A Tableaux Calculus for Ambiguous Quantification
Christof Monz, Maarten de Rijke
Coping with ambiguity has recently received a lot of attention in natural language processing. Most work focuses on the semantic representation of ambiguous expressions. In this pa…