A Resolution Calculus for Dynamic Semantics
classification
💻 cs.CL
cs.AI
keywords
resolutionbindinglanguagenaturalpronounsemanticsactuallyambiguities
read the original 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. Therefore disambiguation is only applied to expression that actually occur during derivations.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.