A Resolution Calculus for Dynamic Semantics
Christof Monz, Maarten de Rijke
Abstract
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.
Create a lesson
Related papers
SpecCompact: Accelerating LLM Agent Context Compaction with Slot-Parallel Semantic Speculative Verification
Yulu An, Yifei Feng, Xiangyang Yin
Balancing hierarchical representation and quantization: A performance trade-off in text embeddings
Kai Ponel, Marco Polignano, Erasmo Purificato et al.
Persona Perspectives: Adopting Viewpoints Reorganizes Representations in LLMs
Austin C. Kozlowski, Avital Mintz, Madison Lee
Before You Continue: Evaluating Time-Sensitive Safety Awareness in Conversational Assistants
Peidi Dong, Yunze Xiao, Yu-Lin Tsai et al.
LooM: Loop-Invariant Memory for Causal Encoder-Decoder Language Models
Lele Yang, Muxi Diao, Zhonghao Yan et al.
SAUCE: Summary Analysis Using Conversation Entailment
Man-Ling Sung, Hemanth Kandula, Jeff Ma et al.