RLET: A Reinforcement Learning Based Approach for Explainable QA with Entailment Trees (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing structured reasoning frameworks lack internal decision probability and cannot model the tree as a whole. |
| Approach: | They propose a Reinforcement Learning based Entailment Tree generation framework that is trained using the cumulative signals across the whole tree. |
| Outcome: | The proposed framework offers explicit deductions with entailment steps in a tree structure. |
Similar Papers
Natural Logic at the Core: Dynamic Rewards for Entailment Tree Generation (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to generating entailment trees lack logical consistency . static reward structures or intricate dependencies within multi-step reasoning are often ignored . |
| Approach: | They propose a method that integrates natural logic principles into reinforcement learning to guide entailment tree generation. |
| Outcome: | Experiments on EntailmentBank show that the proposed method improves interpretability and generalization. |
Explaining Answers with Entailment Trees (2021.emnlp-main)
Copied to clipboard
Bhavana Dalvi, Peter Jansen, Oyvind Tafjord, Zhengnan Xie, Hannah Smith, Leighanna Pipatanangkura, Peter Clark
| Challenge: | ENTAILMENTBANK is the first dataset to contain multistep entailment trees. |
| Approach: | They propose to generate explanations in the form of entailment trees, a tree of multipremise entanglements steps from facts that are known to the hypothesis of interest. |
| Outcome: | The proposed model can generate explanations in the form of entailment trees . this is a tree of multipremise enttailment steps from facts known to the hypothesis of interest. |
Entailment Tree Explanations via Iterative Retrieval-Generation Reasoner (2022.findings-naacl)
Copied to clipboard
Danilo Neves Ribeiro, Shen Wang, Xiaofei Ma, Rui Dong, Xiaokai Wei, Henghui Zhu, Xinchi Chen, Peng Xu, Zhiheng Huang, Andrew Arnold, Dan Roth
| Challenge: | Large language models have achieved high performance on various natural language benchmarks, but the explainability of their output remains elusive. |
| Approach: | They propose an architecture called iterative retrieval-generation reasoner that generates an entailment tree that explains a given hypothesis by using premises from C. |
| Outcome: | The proposed model outperforms existing benchmarks on premise retrieval and entailment tree generation with around 300% gain in overall correctness. |
Step Feasibility-Aware and Error-Correctable Entailment Tree Generation (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for generating entailment trees suffer from false feasible steps, resulting in error propagation. |
| Approach: | They propose an iterative entailment tree generation framework with step feasibility perception and state error handling mechanisms to enhance the interpretability of QA systems. |
| Outcome: | The proposed framework improves the interpretation of QA systems by demonstrating that it is feasible to choose steps that are false feasible and error propagating. |
METGEN: A Module-Based Entailment Tree Generation Framework for Answer Explanation (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing work on QA explanation proposes to explain the answers with entailment trees composed of multiple enlargement steps. |
| Approach: | They propose a Module-based Entailment Tree GENeration framework that has multiple modules and a reasoning controller. |
| Outcome: | The proposed framework outperforms state-of-the-art models on the standard benchmark with only 9% of the parameters. |
SEER: Facilitating Structured Reasoning and Explanation via Reinforcement Learning (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods focus on single-step reasoning, ignoring logical dependencies between steps. |
| Approach: | They propose a method that maximizes a structure-based return to facilitate structured reasoning and explanation. |
| Outcome: | The proposed method outperforms state-of-the-art methods on EntailmentBank and STREET benchmarks. |
Empowering Tree-structured Entailment Reasoning: Rhetorical Perception and LLM-driven Interpretability (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing models for science question answering lack a framework for entailment trees . ambiguities and similarities between science facts complicate the fact retrieval process . |
| Approach: | They propose a framework for building entailment trees for science question answering . they propose to infuse knowledge that bridges the gap between reasoning types and rhetorical relations . |
| Outcome: | The proposed framework improves retrieval capabilities, understanding relationships and generating intermediate conclusions. |
FRVA: Fact-Retrieval and Verification Augmented Entailment Tree Generation for Explainable Question Answering (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for generating a entailment tree exhibit the reasoning chains from knowledge facts to predicted answers, but they have large fact search spaces and error accumulation problems resulting in the generation of invalid steps. |
| Approach: | They propose a Fact-Retrieval and Verification Augmented bidirectional entailment tree generation method that contains two systems. |
| Outcome: | The proposed method outperforms existing models and achieves state-of-the-art performance in fact selection and structural correctness. |
Reward Engineering for Generating Semi-structured Explanation (2024.findings-eacl)
Copied to clipboard
| Challenge: | Unstructured natural language explanations lack a comprehensive explanation mechanism to verify a model's true reasoning capabilities. |
| Approach: | They propose a reward engineering method which uses semi-structured explanations to verify a model's true reasoning capabilities. |
| Outcome: | The proposed method achieves new state-of-the-art on two semi-structured explanation generation benchmarks (ExplaGraph and COPA-SSE) . |
From Sentences to Proof Trees: Leveraging Language Models for Structured Reasoning (2026.eacl-srw)
Copied to clipboard
| Challenge: | Multi-hop reasoning requires a chain of facts to reflect the reasoning behind the answer. |
| Approach: | They propose an inference-guided prompting approach that performs well in natural language questions . they propose a neuro-symbolic approach to reasoning using large language models . |
| Outcome: | The proposed model outperforms all prompting strategies and fine-tunes LLMs trained specifically for proof generation. |