Object oriented design with applications
Object oriented design with applications
Natural language syntax and first-order inference
Artificial Intelligence
Alma-O: an imperative language that supports declarative programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Handbook of Logic and Language
Handbook of Logic and Language
Contextual Inference in Computational Semantics
CONTEXT '99 Proceedings of the Second International and Interdisciplinary Conference on Modeling and Using Context
A Resolution Calculus for Dynamic Semantics
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
A Tableaux Calculus for Ambiguous Quantification
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
LOPSTR '94/META '94 Proceedings of the 4th International Workshops on Logic Programming Synthesis and Transformation - Meta-Programming in Logic
Programming with dynamic predicate logic
Programming with dynamic predicate logic
Axiomatising dynamic logics for anaphora
Axiomatising dynamic logics for anaphora
Ambiguity and reasoning
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Efficient construction of underspecified semantics under massive ambiguity
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Semantic construction from parse forests
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
| Hi-index | 0.00 |
In this paper, we consider some of the problems that arise if automated reasoning methods are applied to natural language semantics. It turns that out that the problem of ambiguity has a strong impact on the feasibility of any theorem prover for computational semantics. We briefly investigate the different aspects of ambiguity and review some of the solutions that have been proposed to tackle this problem.