BC-Prover: Backward Chaining Prover for Formal Theorem Proving (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for interactive theorem proving in formal logic lack robustness and robustness. |
| Approach: | They propose a backward chaining framework guided by pseudo steps for proofstep generation that prioritizes pseudo steps. |
| Outcome: | The proposed framework improves on the miniF2F benchmark. |
Similar Papers
Interpretable Proof Generation via Iterative Backward Reasoning (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing proof generation tasks require reasoning capabilities, but they usually just request for an answer without the reasoning procedure that would make it interpretable. |
| Approach: | They propose an iterative backward reasoning model to solve the proof generation tasks on rule-based Question Answering. |
| Outcome: | The proposed model improves in-domain performance and cross-domain transferability over existing models. |
SymBa: Symbolic Backward Chaining for Structured Natural Language Reasoning (2025.naacl-long)
Copied to clipboard
| Challenge: | Among different methods for structured reasoning, we focus on backward chaining, where the goal is recursively decomposed into subgoals by searching and applying rules. |
| Approach: | They propose a backward chaining system that integrates a symbolic solver and an LLM to improve the performance of LLM-based reasoning. |
| Outcome: | The proposed system improves deductive, relational, and arithmetic reasoning benchmarks compared to baselines. |
LAMBADA: Backward Chaining for Automated Reasoning in Natural Language (2023.acl-long)
Copied to clipboard
| Challenge: | Recent advances in automated reasoning with natural text suffer from a combinatorial explosion of the search space and high failure rates for problems requiring longer chains of reasoning. |
| Approach: | They propose a Backward Chaining algorithm that decomposes reasoning into four sub-modules and implements it by few-shot prompted LLM inference. |
| Outcome: | The proposed algorithm achieves sizable accuracy boosts over state-of-the-art forward reasoning methods on two challenging logical reasoning datasets. |
LogicTree: Structured Proof Exploration for Coherent and Rigorous Logical Reasoning with Large Language Models (2025.emnlp-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) have remarkable multi-step reasoning capabilities, but they still face challenges in complex logical reasoning. |
| Approach: | They propose an algorithm-guided search framework that automates structured proof exploration and ensures logical coherence. |
| Outcome: | The proposed framework outperforms o3-mini and chain-of-thought with average gains of 23.6% and 12.5% on five datasets. |
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. |
PRover: Proof Generation for Interpretable Reasoning over Rules (2020.emnlp-main)
Copied to clipboard
| Challenge: | Recent work shows that transformers can act as “soft theorem provers” by answering questions over explicitly provided knowledge in natural language. |
| Approach: | They propose a transformer-based model that answers binary questions over rule-bases and generates the corresponding proofs. |
| Outcome: | The proposed model generates proofs with an accuracy of 87% while maintaining or improving performance on the QA task. |
Forward-Backward Reasoning in Large Language Models for Mathematical Verification (2024.findings-acl)
Copied to clipboard
| Challenge: | Extensive experiments on six standard mathematical data sets and three LLMs show that FOBAR achieves state-of-the-art performance. |
| Approach: | They propose to combine forward and backward reasoning to verify candidate answers . they propose to use a template to mask a number and ask the LLM to answer a backward question . |
| Outcome: | Experiments on mathematical data show that proposed backward reasoning outperforms Self-Consistency. |
Theorem Prover as a Judge for Synthetic Data Generation (2025.acl-long)
Copied to clipboard
| Challenge: | Recent studies show that large language models are increasingly capable of tackling mathematical problems. |
| Approach: | They propose an approach that iteratively refines theorem prover formalisation to mitigate errors. |
| Outcome: | The proposed method increases execution rate on the Lean prover from 60% to 87%, while human annotation is replaced with theorem prover feedback. |
LINC: A Neurosymbolic Approach for Logical Reasoning by Combining Language Models with First-Order Logic Provers (2023.emnlp-main)
Copied to clipboard
Theo Olausson, Alex Gu, Ben Lipkin, Cedegao Zhang, Armando Solar-Lezama, Joshua Tenenbaum, Roger Levy
| Challenge: | Logical reasoning is an important task for artificial intelligence, says a new study . many prompting-based strategies to enable large language models fail in subtle and unpredictable ways. |
| Approach: | They propose to reformulate logical reasoning tasks by leveraging large language models . they use a modular neurosymbolic programming approach to translate premises and conclusions from natural language to logic . |
| Outcome: | The proposed approach outperforms open-source models on FOLIO and ProofWriter while showing distinct failure modes. |
DT-Solver: Automated Theorem Proving with Dynamic-Tree Sampling Guided by Proof-level Value Function (2023.acl-long)
Copied to clipboard
Haiming Wang, Ye Yuan, Zhengying Liu, Jianhao Shen, Yichun Yin, Jing Xiong, Enze Xie, Han Shi, Yujun Li, Lin Li, Jian Yin, Zhenguo Li, Xiaodan Liang
| Challenge: | Recent advances in neural theorem-proving resort to large language models and tree searches. |
| Approach: | They propose a Dynamic-Tree Driven Theorem Solver to accommodate general theoremes by guiding the search procedure with state confidence and proof-level values. |
| Outcome: | The proposed method outperforms state-of-the-art methods on two popular theorem-proving datasets with a 6.65% improvement on average in terms of success rate. |