Skip to content

Reason Popper-ly: Patching In-Context Reasoning with Inductive Logic Programming

Jul 2026 · arXiv.org · Vol abs/2607.23019 · 0 citations · 30 references
Computer Science

TL;DR

Reason Popper-ly, a neurosymbolic framework that uses inductive logic programming (ILP) to learn relation composition rules from reasoning traces and deploys them as an online verifier for step-level correction, consistently improves terminal accuracy over standard CoT.

Abstract

Chain-of-thought (CoT) prompting enables large language models (LLMs) to tackle multi-step reasoning tasks, yet the generated intermediate steps are not guaranteed to be logically sound. We present Reason Popper-ly, a neurosymbolic framework that uses inductive logic programming (ILP) to learn relation composition rules from reasoning traces and deploys them as an online verifier for step-level correction. Given an LLM-generated trace, the method checks each inferred step against the learned rule table, diagnoses the violation type, rewrites incorrect steps with symbolically derived repairs, and regenerates the remaining suffix so that the model can produce its final answer conditioned on a verified trace. We evaluate on CLUTRR, a multi-hop kinship reasoning benchmark, using five language models over reasoning chains of 2 to 10 hops. Across all models, Reason Popper-ly consistently improves terminal accuracy over standard CoT, with gains of up to 48 percentage points for small models and 15 points for frontier models on the longest chains. Compared with a fully exogenous symbolic pipeline, our method performs better on harder instances by preserving the model's successful grounding while correcting only verifiable reasoning failures. In addition, step-level ILP verification yields a fine-grained error taxonomy that provides diagnostic insight beyond final-answer accuracy.

View source

Similar papers

Jul 2026

SymStep: Symbolic Step Verification for Logical Reasoning

SymStep: an LLM makes one atomic claim at a time (DEDUCE: Alice, pet, Cat), then a lightweight constraint propagator checks the claim for consistency with prior accepted deductions, rejects contradictions, and cascades implied facts automatically.

Aida Usmanova, Rui Gao, Dilshod Azizov et al. · 0 citations
2025

Evaluating the Inductive Abilities of Large Language Models: Why Chain-of-Thought Reasoning Sometimes Hurts More Than Helps

This work presents a theoretical framework that reveals how reasoning steps can amplify error through three failure modes: incorrect sub-task decomposition, incorrect sub-task solving, and incorrect final answer summarization, and introduces structured interventions that adapt CoT generation according to the identified...

Haibo Jin, Peiyan Zhang, Man Luo et al. · 1 citation
Preprint Aug 2026

The Tell-Tale Trace: Detecting Reasoning Failures in LLMs Using Chain-of-Thought Dynamics

Results show that capability failures can manifest as distributed, task-dependent changes in the structure of visible reasoning, and that CoT dynamics agnostic to whether the verbalized trace reflects the model's internal computations can help diagnose and correct failures.

Shashwat Sourav, Aishwarya H. Balwani · 1 citation
Jul 2026

Constraint-Anchored Reasoning Traces

Constraint-Anchored Reasoning Traces (CART) is proposed, a neuro-symbolic framework that trains MLLMs to interleave natural language reasoning steps with symbolic constraint assertions: lightweight, machine-checkable statements about visual content.

Zehua Cheng, Wei Dai, Jiahao Sun · 0 citations
Jul 2026

Answer-Conditioned Chains of Thought Degrade Verifiable-Reasoning Distillation in Large Language Models

This work shows that training a strong instruction-tuned reasoning model on its own answer-conditioned chains sharply lowers its verifiable-reasoning accuracy, and generates answer-blind data, because no correctness filter can see this damage in the data.

Jungseob Lee, Seungyoon Lee, Suhyune Son et al. · 0 citations
Jul 2026

OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping

OS-Pruner is a lightweight plug-in framework that formulates chain-of-thought pruning as an optimal stopping problem that achieves 20-60\% reduction in generation length with minimal accuracy sacrifice on diverse reasoning benchmarks and base models.

Mohammed Ehab, Aymane El Gadarri, Vivek F. Farias et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.