A Resolution Calculus for Dynamic Semantics

  • Christof Monz
  • Maarten de Rijke
Conference paper

DOI: 10.1007/3-540-49545-2_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1489)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Christof Monz
    • 1
  • Maarten de Rijke
    • 1
  1. 1.ILLCUniversity of AmsterdamAmsterdamThe Netherlands

Personalised recommendations