论文标题

解释:可解释的科学问题回答的绑架推理

ExplanationLP: Abductive Reasoning for Explainable Science Question Answering

论文作者

Thayaparan, Mokanarangan, Valentino, Marco, Freitas, André

论文摘要

我们提出了一种新颖的方法,用于通过基础和抽象的推理链来回答和解释多项选择科学问题。本文将问题框出作为绑架推理问题,为每个选择构建合理的解释,然后选择最终解释的候选人作为最终答案。我们的系统,解释LP,通过为每个候选人的答案构建一个相关事实的加权图并提取满足某些结构性和语义约束的事实,从而引发了解释。为了提取解释,我们采用了线性编程形式主义,旨在选择最佳子图。图表的加权函数由一组参数组成,我们将其微调以优化答案选择性能。我们在世界溪和弧形挑战语料库上进行实验,以证明以下结论:(1)取消取消提取的推论链提供语义控制,以执行可解释的绑架效率(2)通过较少的访问量来实现可解释的效率和稳健性,从而超过了可解释的当代和转换的方法(3)(3)(3)(3)一般科学问题集的方法。

We propose a novel approach for answering and explaining multiple-choice science questions by reasoning on grounding and abstract inference chains. This paper frames question answering as an abductive reasoning problem, constructing plausible explanations for each choice and then selecting the candidate with the best explanation as the final answer. Our system, ExplanationLP, elicits explanations by constructing a weighted graph of relevant facts for each candidate answer and extracting the facts that satisfy certain structural and semantic constraints. To extract the explanations, we employ a linear programming formalism designed to select the optimal subgraph. The graphs' weighting function is composed of a set of parameters, which we fine-tune to optimize answer selection performance. We carry out our experiments on the WorldTree and ARC-Challenge corpus to empirically demonstrate the following conclusions: (1) Grounding-Abstract inference chains provides the semantic control to perform explainable abductive reasoning (2) Efficiency and robustness in learning with a fewer number of parameters by outperforming contemporary explainable and transformer-based approaches in a similar setting (3) Generalisability by outperforming SOTA explainable approaches on general science question sets.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源