Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Centering: a framework for modeling the local coherence of discourse
Computational Linguistics
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
A Tableaux Calculus for Ambiguous Quantification
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Ambiguity and reasoning
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Contextual Inference in Computational Semantics
CONTEXT '99 Proceedings of the Second International and Interdisciplinary Conference on Modeling and Using Context
A Tableau Calculus for Pronoun Resolution
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Hi-index | 0.00 |
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. To this end, disambiguation is only applied to expressions that actually occur during derivations. Given a set of premises and a conclusion, our resolution method only delivers pronoun bindings that are needed to derive the conclusion.