A Resolution Calculus for Dynamic Semantics

Details A Resolution Calculus for Dynamic Semantics A Resolution Calculus for Dynamic Semantics

2000-09-21

arxiv.org/abs/cs/0009018v1

In: J. Dix, L. Farinas del Cerro, and U. Furbach (eds.) Logics in Artificial Intelligence (JELIA'98). Lecture Notes in Artific

Computer Science

Computation and Language

15 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Resolution Calculus for Dynamic 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 A Resolution Calculus for Dynamic Semantics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Resolution Calculus for Dynamic Semantics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-131345