English

Enhancing Mathematical Problem Solving in LLMs through Execution-Driven Reasoning Augmentation

Artificial Intelligence 2026-02-10 v2 Machine Learning Multiagent Systems

Abstract

Mathematical problem solving is a fundamental benchmark for assessing the reasoning capabilities of artificial intelligence and a gateway to applications in education, science, and engineering where reliable symbolic reasoning is essential. Although recent advances in multi-agent LLM-based systems have enhanced their mathematical reasoning capabilities, they still lack a reliably revisable representation of the reasoning process. Existing agents either operate in rigid sequential pipelines that cannot correct earlier steps or rely on heuristic self-evaluation that can fail to identify and fix errors. In addition, programmatic context can distract language models and degrade accuracy. To address these gaps, we introduce Iteratively Improved Program Construction (IIPC), a reasoning method that iteratively refines programmatic reasoning chains and combines execution feedback with the native Chain-of-thought abilities of the base LLM to maintain high-level contextual focus. IIPC surpasses competing approaches in the majority of reasoning benchmarks on multiple base LLMs. All code and implementations are released as open source.

Keywords

Cite

@article{arxiv.2602.03950,
  title  = {Enhancing Mathematical Problem Solving in LLMs through Execution-Driven Reasoning Augmentation},
  author = {Aditya Basarkar and Benyamin Tabarsi and Tiffany Barnes and Dongkuan Xu},
  journal= {arXiv preprint arXiv:2602.03950},
  year   = {2026}
}

Comments

9 pages, 7 figures, submitted to ACL ARR 2026, hyperlink to code repository provided in the abstract

R2 v1 2026-07-01T09:34:57.724Z