Challenge: Large language models have shown strong performance in many reasoning benchmarks, but lack robust planning or symbolic abstractions.
Approach: They propose to synthesize high-quality symbolic reasoning trajectories with stepwise pseudo-labels at scale via Monte Carlo estimation.
Outcome: The proposed method can be trained on high-quality symbolic reasoning trajectories with stepwise pseudo-labels at scale using Monte Carlo estimation.

Similar Papers

Learning Planning-based Reasoning by Trajectories Collection and Process Reward Synthesizing (2024.emnlp-main)

Copied to clipboard

Challenge: Recent studies have raised concerns regarding the hallucination and flaws in their reasoning process.
Approach: They propose a framework to learn planning-based reasoning through Direct Preference Optimization on collected trajectories, which are ranked according to synthesized process rewards.
Outcome: The proposed model surpasses GPT-3.5-Turbo on logical reasoning benchmarks on a set of logically-based reasoning tasks.
Process Reward Models Meet Planning: Generating Precise and Scalable Datasets for Step-Level Rewards (2026.acl-long)

Copied to clipboard

Challenge: Existing PRM datasets are expensive to construct and limited to the mathematical domain.
Approach: They propose a method to generate a corpus of one million reasoning steps using the Planning Domain Definition Language.
Outcome: The proposed model generates a corpus of approximately one million reasoning steps across various PDDL domains and trains them.
Reasoning with Language Model is Planning with World Model (2023.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have shown remarkable reasoning capabilities, particularly with Chain-of-Thought-style prompts.
Approach: They propose a framework that repurposes the LLM as both a world model and a reasoning agent and incorporates a principled planning algorithm (based on Monte Carlo Tree Search)
Outcome: The proposed framework repurposes the LLM as both a world model and a reasoning agent and incorporates a principled planning algorithm (based on Monte Carlo Tree Search) it achieves optimum balance between exploration and exploitation, while achieving high-reward reasoning paths efficiently.
Process-Supervised Reward Models for Verifying Clinical Note Generation: A Scalable Approach Guided by Domain Expertise (2025.emnlp-main)

Copied to clipboard

Challenge: Currently, no automated, scalable method exists to evaluate the quality of LLM-generated clinical notes, leaving manual evaluation the gold standard.
Approach: They propose a framework for training PRMs to deliver step-level reward signals for LLM-generated clinical notes.
Outcome: The proposed framework outperforms reasoning and non-reasoning models on key evaluations and selects physician-preferred clinical notes with 56.2% accuracy.
AgentPro: Enhancing LLM Agents with Automated Process Supervision (2025.emnlp-main)

Copied to clipboard

Challenge: Existing frameworks lack explicit supervision during the reasoning process, which may lead to error propagation across reasoning chains.
Approach: They propose a framework which automates process supervision for large language model agents by automatically generating step-level annotations and developing a process reward model based on these annotations.
Outcome: The proposed framework outperforms existing agent-based methods on four datasets and achieves a 6.32% increase in accuracy.
Integrating Symbolic Execution into the Fine-Tuning of Code-Generating LLMs (2025.naacl-srw)

Copied to clipboard

Challenge: Code-generating Large Language Models (LLMs) have become essential tools in modern software development, enhancing productivity and accelerating development.
Approach: They propose to use Reinforcement Learning and Direct Preference Optimization to fine-tune code-generating Large Language Models (LLMs) by enhancing the training data with symbolic execution techniques.
Outcome: The proposed model improves on the CodeRL benchmark and shows that it is more accurate and objective than the baseline model.
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%.
Meta-Reasoning: Semantics-Symbol Deconstruction for Large Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods rely on syntactically mapping natural languages to complete formal languages like Python and SQL.
Approach: They propose to deconstruct reasoning-independent semantic information into generic symbolic representations, thereby efficiently capturing more generalized reasoning knowledge.
Outcome: The proposed method improves in-context reasoning accuracy, learning efficiency, out-of-domain generalization, and output stability compared to the Chain-of thought technique.
Verified Critical Step Optimization for LLM Agents (2026.findings-acl)

Copied to clipboard

Challenge: Critical Step Optimization (CSO) focuses preference learning on verified critical steps where alternative actions demonstrably flip task outcomes from failure to success.
Approach: They propose a method which focuses preference learning on verified critical steps where alternative actions demonstrably flip task outcomes from failure to success.
Outcome: The proposed method outperforms the existing methods on GAIA-Text-103 and XBench-DeepSearch while requiring supervision at only 16% of trajectory steps.
Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoning (2023.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models (LLMs) have shown human-like reasoning abilities but struggle with complex logical problems.
Approach: They propose a framework which integrates large language models with symbolic solvers to improve logical problem-solving by combining them with a self-refinement module.
Outcome: The proposed framework improves logical problem-solving by integrating LLMs with symbolic solvers.

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