monzilla.net / research / publications / full text


abstract
A Resolution Calculus for Dynamic Semantics

Christof Monz and Maarten de Rijke

In: J. Dix, L. Ferinas del Cerro, and U. Furbach (eds.) Logics in Artificial Intelligence (JELIA'98). Lecture Notes in Artificial Intelligence 1489, Springer, 1998, pp. 184-198.

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. Therefore disambiguation is only applied to expression that actually occur during derivations.

[ PostScript | PostScript (gnu-zipped) | PDF ]


links
co-author(s): Maarten de Rijke
research project(s): Computational Semantics and Theorem Proving
conference site: JELIA'98
publisher information: Copyright © by Springer


BibTeX entry
@InProceedings{monz:98jelia,
  author = 	 {Monz, Christof and de~Rijke, Maarten},
  title = 	 {A Resolution Calculus for 
                  Dynamic Semantics},
  booktitle = 	 {Logics in Artificial Intelligence 
                  {(JELIA'98)}},
  year =	 {1998},
  editor =       {Dix, J. and Ferinas del Cerro, L.
                  and Furbach, U.},
  series =	 {Lecture Notes in Artificial 
                  Intelligence 1489},
  pages =        {184--198},
  publisher =	 {Springer}
}