Challenge: a new framework for complex reasoning with LLMs is developed to improve reasoning proof accuracy and interpretability.
Approach: They propose to use LLMs to generate search logs that can be interpreted into human-readable reasoning proofs.
Outcome: The proposed framework improves reasoning accuracy but lacks interpretability due to black-box nature of the solvers.

Similar Papers

Adaptive LLM-Symbolic Reasoning via Dynamic Logical Solver Composition (2026.eacl-long)

Copied to clipboard

Challenge: Existing approaches to NLP are static and require manual formalization.
Approach: They propose an adaptive, multi-paradigm, neuro-symbolic inference framework that automatically identifies formal reasoning strategies from problems expressed in natural language and dynamically selects and applies specialized formal logical solvers.
Outcome: The proposed framework outperforms baselines on individual and multi-paradigm reasoning tasks by 17% and 6%.
Format-Adapter: Improving Reasoning Capability of LLMs by Adapting Suitable Format (2026.findings-acl)

Copied to clipboard

Challenge: Prior work showed that multiple reasoning formats outperform a single format when generating multiple answers.
Approach: They propose a method to measure reasoning error when generating multiple answers . they propose 'formatadapter' which generates and selects suitable reasoning formats .
Outcome: The proposed method achieves a 4.3% performance improvement over previous works on math and commonsense reasoning tasks.
Assessing the Reasoning Capabilities of LLMs in the context of Evidence-based Claim Verification (2025.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have shown remarkable proficiency in complex tasks where reasoning capabilities are paramount.
Approach: They propose a framework to break down claims into atomic reasoning types needed for verification.
Outcome: The proposed framework breaks down claims into atomic reasoning types needed for verification.
Code to Think, Think to Code: A Survey on Code-Enhanced Reasoning and Reasoning-Driven Code Intelligence in LLMs (2025.emnlp-main)

Copied to clipboard

Challenge: Recent breakthrough models like OpenAI-o1 and DeepSeek-R1 show powerful task-solving capabilities, particularly advances in reasoning.
Approach: They propose future research directions that may deepen the synergy, ultimately advancing LLM performance in both complex reasoning and code intelligence.
Outcome: The proposed research may deepen the synergy, ultimately advancing LLM performance in both complex reasoning and code intelligence.
Verification and Refinement of Natural Language Explanations through LLM-Symbolic Theorem Proving (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods for assessing the validity of explanations for NLI are time-consuming and prone to logical errors.
Approach: They propose a framework that integrates Large Language Models and Theorem Provers to verify and refine natural language explanations through crowd-sourcing . they propose to use TPs to generate and formalise explanatory sentences and suggest potential inference strategies for NLI.
Outcome: The proposed framework generates and formalises explanatory sentences and suggests potential inference strategies for NLI.
Current Advances in LLM Reasoning (2026.acl-tutorials)

Copied to clipboard

Challenge: This tutorial examines comprehensive evaluation strategies to assess the reasoning abilities of large language models (LLMs) advanced inference time methods and post-training methods that aim to make LLMs think more like humans are discussed in this tutorial.
Approach: This tutorial explores comprehensive evaluation strategies to assess the reasoning abilities of large language models (LLMs) and discusses two types of methods to improve models’ reasoning: advanced inference time methods, structured and self-improvement inference methods, and post-training methods, such as RLHF, DPO, and GRPO.
Outcome: This tutorial examines evaluation strategies to assess the reasoning abilities of large language models and discusses two types of methods to improve models’ reasoning.
Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations (2025.acl-long)

Copied to clipboard

Challenge: Recent work has shown that the interaction of large language models (LLMs) with theorem provers (TPs) can help verify and improve the validity of NLI explanations.
Approach: They propose to use logical expressions to guide LLMs in generating structured proof sketches and to use them to improve their accuracy.
Outcome: The proposed strategies improve autoformalisation, syntactic errors and explanation refinement over the state-of-the-art model.
LLMs Faithfully and Iteratively Compute Answers During CoT: A Systematic Analysis With Multi-step Arithmetics (2026.findings-eacl)

Copied to clipboard

Challenge: Specifically, we examine when the LLMs’ answer is (pre)determined, especially before the CoT begins or after, and how strongly the information from CoT specifically has a causal effect on the final answer.
Approach: They examine when the LLMs’ answer is (pre)determined, especially before the CoT begins or after, and how strongly the information from CoT specifically has a causal effect on the final answer.
Outcome: The proposed model can generate reasoning chains while generating the reasoning chain on the fly.
LINC: A Neurosymbolic Approach for Logical Reasoning by Combining Language Models with First-Order Logic Provers (2023.emnlp-main)

Copied to clipboard

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.
Confidence Improves Self-Consistency in LLMs (2025.findings-acl)

Copied to clipboard

Challenge: Modern large language models (LLMs) demonstrate strong reasoning capabilities, driven in part by their capacity to generate a sequence of intermediate reasoning steps that lead them toward a final answer.
Approach: They propose a method that performs a weighted majority vote based on confidence scores obtained directly from the model.
Outcome: The proposed method outperforms self-consistency on nine models and four datasets, reducing the required number of reasoning paths by over 40% on average.

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