Christof Monz and Maarten de Rijke

In: Proceedings of the First International Workshop on Labelled Deduction (LD'98). Dept. of Computer Science, Freiburg, Germany, 1998.

This paper concerns the application of resolution theorem proving to natural language semantics. We focus on the problem of efficient pronoun binding in a discourse, trying to circumvent the enormous computational complexity triggered by natural language ambiguities like pronoun binding. Automated deduction steps and pronoun binding are interleaved with the effect that only pronouns that are used during a derivation are bound to a possible antecedent. Labels are used to encode structural information which is essential to define possible pronoun bindings. It turns out, that the notion of pronoun binding can be reduced to the notion of labeled unification.

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

@InProceedings{monz:98labeled,
  author = 	 {Monz, C. and de~Rijke, M.},
  title = 	 {Labeled Resolution for Discourse Semantics},
  booktitle = 	 {Proceedings of the First International 
                  Workshop on Labelled Deduction {(LD'98)}},
  year =	 1998,
  publisher =	 {Dept. of Computer Science, 
                  University of Freiburg}
}