First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
On the Representation of Context
Journal of Logic, Language and Information
A Resolution Calculus for Dynamic Semantics
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
LOPSTR '94/META '94 Proceedings of the 4th International Workshops on Logic Programming Synthesis and Transformation - Meta-Programming in Logic
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Entailment, intensionality and text understanding
HLT-NAACL-TEXTMEANING '03 Proceedings of the HLT-NAACL 2003 workshop on Text meaning - Volume 9
| Hi-index | 0.00 |
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 discourse, several inference tasks arise. Instead of treating these inferences independently of each other, we show how integrating techniques from formal approaches to context into deduction can help to compute presuppositions more efficiently. Contexts are represented as Discourse Representation Structures and the way they are nested is made explicit. In addition, a tableau calculus is present which keeps track of contextual information, and thereby allows to avoid carrying out redundant inference steps as it happens in approaches that neglect explicit nesting of contexts.