A Resolution Calculus for Dynamic Semantics
计算与语言
2007-05-23 v1 人工智能
摘要
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.
引用
@article{arxiv.cs/0009018,
title = {A Resolution Calculus for Dynamic Semantics},
author = {Christof Monz and Maarten de Rijke},
journal= {arXiv preprint arXiv:cs/0009018},
year = {2007}
}
备注
15 pages