SAGE: Satisfiability Guided Decoding for Mathematical Reasoning

Tamanna Hossain, Sameer Singh, Kareem Ahmed


Abstract
Chain-of-thought prompting improves mathematical reasoning, but generated reasoning chains can appear locally plausible while being globally inconsistent. Later steps may derive equations inconsistent with claims asserted earlier. We propose SAGE, a training-free decoding approach that treats symbolic consistency as probabilistic conditioning over mathematical claims, conditioning each new claim on the symbolic state accumulated from earlier steps. SAGE approximates this conditional distribution online by resampling at mathematical span boundaries: candidate continuations are parsed into formal claims and selected according to satisfiability with the accumulated symbolic state. This statement-level decoding avoids intractable token-level constrained decoding while still using solver feedback online, before a complete solution has been generated. Across MATH-500, Gaokao, and Minerva, SAGE improves LLaMA, DeepSeek, and Qwen models over temperature sampling. On MATH-500, it improves accuracy by up to 6.3% and by 3.1% on average across four models. On Gaokao and Minerva datasets, SAGE yields consistent gains across models, improving Gaokao and Minerva pass@3 by up to 2% and 3%, respectively. We release our code at https://github.com/tamannahossainkay/sage
Anthology ID:
2026.findings-emnlp.2313
Volume:
Findings of the Association for Computational Linguistics: EMNLP 2026
Month:
October
Year:
2026
Address:
Budapest, Hungary
Editors:
Hung-Yi Lee, Sunipa Dev, Jessy Li, Desmond Elliott
Venue:
Findings
SIG:
SIGDAT
Publisher:
Association for Computational Linguistics
Note:
Pages:
49649–49665
Language:
URL:
https://aclanthology.org/2026.findings-emnlp.2313/
DOI:
10.18653/2026.findings-emnlp.2313
Bibkey:
Cite (ACL):
Tamanna Hossain, Sameer Singh, and Kareem Ahmed. 2026. SAGE: Satisfiability Guided Decoding for Mathematical Reasoning. In Findings of the Association for Computational Linguistics: EMNLP 2026, pages 49649–49665, Budapest, Hungary. Association for Computational Linguistics.
Cite (Informal):
SAGE: Satisfiability Guided Decoding for Mathematical Reasoning (Hossain et al., Findings 2026)
Copy Citation:
PDF:
https://aclanthology.org/2026.findings-emnlp.2313.pdf