A Tableau Calculus for Pronoun Resolution

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.Comment: 16 page

Computing Presuppositions by Contextual Reasoning

This paper describes how automated deduction methods for natural language processing can be applied more efficiently by encoding context in a more elaborate way. Our work is based on formal approaches to context, and we provide a tableau calculus for contextual reasoning. This is explained by considering an example from the problem area of presupposition projection.Comment: 5 page

Deducción y generación de modelos de cardinalidad finita

Presentamos un procedimiento de tablas semánticas distinto de las estándar en el tratamiento dado a las sentencias de la clase δ, proponiendo modificaciones de esta regla que eviten la generación de ramas infinitas. Las nuevas tablas se revelan útiles para el estudio de lenguajes lógico-formales con semántica finitaria, en particular como procedimiento para definir modelos finitos de sentencias satisfacibles. Mostramos también la aplicabilidad de estos resultados al análisis de la ambigüedad y otros fenómenos en la interpretación del discurso