Verification and Refinement of Natural Language Explanations through LLM-Symbolic Theorem Proving

arXiv:2405.01379v1 Announce Type: new
Abstract: Natural language explanations have become a proxy for evaluating explainable and multi-step Natural Language Inference (NLI) models. However, assessing the validity of explanations for NLI is challenging as it typically involves the crowd-sourcing of apposite datasets, a process that is time-consuming and prone to logical errors. To address existing limitations, this paper investigates the verification and refinement of natural language explanations through the integration of Large Language Models (LLMs) and Theorem Provers (TPs). Specifically, we …

abstract arxiv become crowd-sourcing cs.cl datasets however inference language llm natural natural language process theorem through type verification