Generating Natural Language Proofs with Verifier-Guided Search (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing stepwise methods struggle to generate valid proof steps based on the hypothesis . instead, they generate invalid steps . |
| Approach: | They propose a stepwise method which generates relevant steps conditioning on the hypothesis. |
| Outcome: | The proposed method improves correctness of predicted proofs from 27.7% to 33.3% on EntailmentBank and RuleTaker. |
Similar Papers
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. |
Natural Language Deduction with Incomplete Information (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing systems for reasoning given incomplete information are inadequate . current approaches to reasoning are based on latent reasoning by large language models . |
| Approach: | They propose a system that generates a natural language "proof" by abductively inferring a premise from another premise and a conclusion. |
| Outcome: | The proposed system can handle the underspecified setting where not all premises are stated at the outset; additional assumptions need to be materialized to prove a claim. |
ProofWriter: Generating Implications, Proofs, and Abductive Statements over Natural Language (2021.findings-acl)
Copied to clipboard
| Challenge: | Recent work shows that transformers can generate both implications of a theory and the natural language proofs that support them. |
| Approach: | They propose a generative model that generates both implications of a theory and natural language proofs that support them. |
| Outcome: | The proposed model generates both implications of a theory and the natural language proofs that support them. |
Think While You Write: Hypothesis Verification Promotes Faithful Knowledge-to-Text Generation (2024.findings-naacl)
Copied to clipboard
| Challenge: | Knowledge-to-text generators often struggle to faithfully generate descriptions for input facts . we propose a decoding-only method to reduce hallucinations . |
| Approach: | They propose a decoding-only method to generate accurate descriptions for input facts . they use a Natural Language Inference model as the model and replace it with a task-specific HVM . |
| Outcome: | The proposed method improves faithfulness with minimal impact on quality and in/out-of-distribution evaluations. |
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. |
ProofInfer: Generating Proof via Iterative Hierarchical Inference (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing proof generation models focus on generating several proof paths instead of a whole tree. |
| Approach: | They propose a method that generates the proof tree via iterative hierarchical inference . they propose coding the proof as plain text without losing structure information . |
| Outcome: | The proposed proof generation model significantly improves performance on widely-used datasets. |
Natural Language Deduction through Search over Statement Compositions (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods focus on the end-to-end discriminative version of this task, but less work has treated the generative version of the task. |
| Approach: | They propose a system that decomposes the task into separate steps coordinated by a search procedure and produces a tree of intermediate conclusions that faithfully reflects the system’s reasoning process. |
| Outcome: | The proposed system proves true statements while rejecting false ones on the EntailmentBank dataset with a 17% absolute higher step validity than the end-to-end T5 model. |
Enhancing Mathematical Reasoning in LLMs by Stepwise Correction (2025.acl-long)
Copied to clipboard
| Challenge: | Existing Best-of-N decoding methods often lead to incorrect solutions . a novel method is proposed to help large language models identify and revise incorrect steps in their generated reasoning paths. |
| Approach: | They propose a method that helps large language models identify and revise incorrect steps in their generated reasoning paths. |
| Outcome: | The proposed method outperforms the state-of-the-art Best-ofN decoding method by +2.4 and reduces token consumption by 77.8%. |
How Decoding Strategies Affect the Verifiability of Generated Text (2020.findings-emnlp)
Copied to clipboard
Luca Massarelli, Fabio Petroni, Aleksandra Piktus, Myle Ott, Tim Rocktäschel, Vassilis Plachouras, Fabrizio Silvestri, Sebastian Riedel
| Challenge: | Recent advances in pre-trained language models have generated text of an increasingly high quality. |
| Approach: | They propose a decoding strategy that produces less repetitive and more verifiable text. |
| Outcome: | The proposed method produces less repetitive and more verifiable text than previously used decoding strategies. |
Scaling Synthetic Logical Reasoning Datasets with Context-Sensitive Declarative Grammars (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing proof generation algorithms bias reasoning toward specific proof traces and limit extensibility. |
| Approach: | They propose a framework with flexible context-sensitive rules binding multiple languages . they propose to use English verbalization of predicates to enhance logical reasoning . |
| Outcome: | The proposed framework surpasses GPT-4 in accuracy on a human-authored logic dataset by 12%. |