Computer Science – Computation and Language
Scientific paper
2000-09-20
In: P. Bouquet, P. Brezillon, L. Serafini, M. Benerecetti, F. Castellani (Eds.) 2nd International and Interdisciplinary Confer
Computer Science
Computation and Language
Scientific paper
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.
No associations
LandOfFree
Contextual Inference in Computational Semantics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Contextual Inference in Computational Semantics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Contextual Inference in Computational Semantics will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-367530