A Resolution Calculus for Dynamic Semantics
- Cite this paper as:
- Monz C., de Rijke M. (1998) A Resolution Calculus for Dynamic Semantics. In: Dix J., del Cerro L.F., Furbach U. (eds) Logics in Artificial Intelligence. JELIA 1998. Lecture Notes in Computer Science, vol 1489. Springer, Berlin, Heidelberg
This paper applies resolution theorem proving to natural language semantics. The aim is to circumvent the computational complexity triggered by natural language ambiguities like pronoun binding, by interleaving pronoun binding with resolution deduction. To this end, disambiguation is only applied to expressions that actually occur during derivations. Given a set of premises and a conclusion, our resolution method only delivers pronoun bindings that are needed to derive the conclusion.
Unable to display preview. Download preview PDF.