Deductions with Meaning

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.

• Type: Conference
• Year: 1998
• Where: LACL
• Authors: Christof Monz, Maarten de Rijke
• Keywords: Automated Reasoning, Computational Semantics, LACL 1998, Natural Language Semantics