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.

Similar Papers

Entailment Tree Explanations via Iterative Retrieval-Generation Reasoner (2022.findings-naacl)

Copied to clipboard

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.
Explaining Answers with Entailment Trees (2021.emnlp-main)

Copied to clipboard

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.
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.
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.
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.
Entailer: Answering Questions with Faithful and Truthful Chains of Reasoning (2022.emnlp-main)

Copied to clipboard

Challenge: a system that can show how its answers are implied by its own internal beliefs via a systematic chain of reasoning would allow better understanding of why a model produced the answer it did.
Approach: They propose to combine a backward-chaining model with a verifier that checks that the model itself believes those premises through self-querying to generate multistep chains that are both faithful (the answer follows from the reasoning)
Outcome: The proposed model generates chains that are faithful and truthful while maintaining answer accuracy.
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.
Leveraging Frequent Query Substructures to Generate Formal Queries for Complex Question Answering (D19-1)

Copied to clipboard

Challenge: Existing approaches build universal paraphrasing or ranking models for whole questions . current approaches build a universal ranking model for the whole questions, which fails for complex, long-tail questions.
Approach: They propose a new query generation approach based on frequent query substructures which helps rank existing query structures or build new query structures.
Outcome: The proposed approach significantly outperforms existing models on two benchmark datasets.
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.
An Answer is just the Start: Related Insight Generation for Open-Ended Document-Grounded QA (2026.findings-acl)

Copied to clipboard

Challenge: Existing QA benchmarks do not explicitly support document-grounded related insight generation . Existing document-based QA efforts focus on answering fact-based questions .
Approach: They propose a task to generate additional insights from a document collection that improves, extends or rethinks an initial answer to an open-ended question.
Outcome: The proposed task improves, extends, or rethinks an answer to an open-ended question.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations