6 papers · 1 filter
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…
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…
Contextual Inference in Computational Semantics
Christof Monz
In this paper, an application of automated theorem proving techniques to computational semantics is considered. In order to compute the presuppositions of a natural language discou…
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…
Combining Linguistic and Spatial Information for Document Analysis
Marco Aiello, Christof Monz, Leon Todoran
We present a framework to analyze color documents of complex layout. In addition, no assumption is made on the layout. Our framework combines in a content-driven bottom-up approach…
Modeling Ambiguity in a Multi-Agent System
Christof Monz
This paper investigates the formal pragmatics of ambiguous expressions by modeling ambiguity in a multi-agent system. Such a framework allows us to give a more refined notion of th…