AI Chat AI Image Generator AI Video Text to Speech

A Resolution Calculus for Dynamic Semantics

09/21/2000

∙

by Christof Monz, et al.

∙

∙

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.

Christof Monz
31 publications
Maarten de Rijke
166 publications

research

∙ 09/21/2000

A Tableau Calculus for Pronoun Resolution

We present a tableau calculus for reasoning in fragments of natural lang...

0 Christof Monz, et al. ∙

research

∙ 05/13/2016

Natural Language Semantics and Computability

This paper is a reflexion on the computability of natural language seman...

0 Richard Moot, et al. ∙

research

∙ 02/15/2017

Theorem Proving Based on Semantics of DNA Strand Graph

Because of several technological limitations of traditional silicon base...

0 Kumar S. Ray, et al. ∙

research

∙ 10/26/2018

Static and Dynamic Vector Semantics for Lambda Calculus Models of Natural Language

Vector models of language are based on the contextual aspects of languag...

0 Mehrnoosh Sadrzadeh, et al. ∙

research

∙ 09/20/2000

Contextual Inference in Computational Semantics

In this paper, an application of automated theorem proving techniques to...

0 Christof Monz, et al. ∙

research

∙ 04/22/2016

Exploiting Deep Semantics and Compositionality of Natural Language for Human-Robot-Interaction

We develop a natural language interface for human robot interaction that...

0 Manfred Eppe, et al. ∙

research

∙ 08/10/2022

A Quantum Natural Language Processing Approach to Pronoun Resolution

We use the Lambek Calculus with soft sub-exponential modalities to model...

0 Hadi Wazni, et al. ∙