A Resolution Calculus for Dynamic Semantics

09/21/2000
by   Christof Monz, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset