MaxSAT-Based Feedback for Guiding Vision-Language Models in Sudoku
On the map: LLM reasoning → Reasoning benchmarks and evaluation
Abstract (arXiv)
Vision--Language Models (VLMs) have recently demonstrated promising performance on structured visual reasoning tasks, including grid-based puzzles. However, despite strong perceptual capabilities, these models lack explicit mechanisms for enforcing logical consistency and frequently generate assignments that violate underlying constraints. In this paper, we propose a neuro-symbolic approach that integrates formal constraint reasoning into the VLM solving process via a Maximum Satisfiability (MaxSAT) oracle. Rather than computing solutions directly, the symbolic component acts as a consistency validator and refinement engine. Candidate placements generated by the VLM are encoded as soft clauses in a partial MaxSAT formulation, while Sudoku constraints remain hard clauses. When inconsistencies arise, the MaxSAT solver identifies a largest mutually consistent subset of assignments, which is then translated into structured textual and visual feedback to guide subsequent refinements. We evaluate our approach on a Sudoku dataset across multiple open-source and closed-access VLMs. Results show that MaxSAT-based feedback improves logical consistency and increases the number of solved instances, particularly in full-board refinement mode. These findings demonstrate that symbolic optimisation can enhance the reliability of vision-language reasoning.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Reasoning benchmarks and evaluation, one of 17 directions in LLM reasoning. Builds on 14 of its 32 references that are in the map. First posted on arXiv 14 Jul 2026.
Builds on
14 of 32 references.
Closest ancestors · 5
Same direction, newest first
- 2025Qwen3 Technical Report14 May
- 2025ZebraLogic: On the Scaling Limits of LLMs for Logical Reasoning3 Feb
- 2023Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoning20 May
- 2023SatLM: Satisfiability-Aided Language Models Using Declarative Prompting16 May
- 2022PAL: Program-aided Language Models18 Nov
Other references · 9
- 2025The Illusion of Thinking: Understanding the Strengths and Limitations of Reasoning Models via the Lens of Problem Complexitycited by 302
- 2026Molmo2: Open Weights and Data for Vision-Language Models with Video Understanding and Groundingcited by 139
- 2024Large Language Models Can Solve Real-World Planning Rigorously with Formal Verification Toolscited by 47
- 2024Planning Anything with Rigor: General-Purpose Zero-Shot Planning with LLM-based Formalized Programmingcited by 35
- 2025ConstraintLLM: A Neuro-Symbolic Framework for Industrial-Level Constraint Programmingcited by 10
- 2024Counterexample Guided Program Repair Using Zero-Shot Learning and MaxSAT-based Fault Localizationcited by 8
- 2025MuSLR: Multimodal Symbolic Logical Reasoningcited by 7
- 2025PyVeritas: On Verifying Python via LLM-Based Transpilation and Bounded Model Checking for Ccited by 4
- 2025Preference Elicitation for Step-Wise Explanations in Logic Puzzlescited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026Think-Verify-Revise: Neuro-Symbolic Visual Reasoning with Vision-Language Models and Dynamic Logic Tensor Networks
- 2025Teaching Transformers to Solve Combinatorial Problems through Efficient Trial & Error
- 2024Causal Language Modeling Can Elicit Search and Reasoning Capabilities on Logic Puzzles
- 2023Assessing SATNet's Ability to Solve the Symbol Grounding Problem
- 2026AdaC-GRPO: Towards Mastering Long-Horizon Visual Sudoku Puzzles via Adaptive Curriculum Learning
- 2025Sudoku-Bench: Evaluating creative reasoning with Sudoku variants
- 2025Liquid Reasoning Transformers: A Sudoku-Based Prototype for Chess-Scale Algorithmic Tasks
- 2026DiBS: Diffusion-Informed Branch Selection