Journal article · 2026 · Open access

Formal Reasoning Meets LLMs: Toward AI for Mathematics and Verification

Kaiyu Yang, Gabriel Poesia, Jingxuan He, Wenda Li, Kristin Lauter, Swarat Chaudhuri, Dawn Xiaodong Song

Communications of the ACM, 69(3), 66–73 · Published 10 February 2026 · DOI 10.1145/3750038

Open full textCite this paper

In brief

“Formal Reasoning Meets LLMs: Toward AI for Mathematics and Verification” is a 2026 journal article by Kaiyu Yang and 6 co-authors, published in Communications of the ACM. OpenAlex counts 11 citations as of 17 November 2026, which puts it in the top 2% of works published in 2026 by citations. It is open access under a CC BY licence: the full text is free to read at Communications of the ACM.

Citations
11
Most cited in
2026 (11)
Field-weighted impact
25.34
References
26
Authors
7

Abstract

Formal reasoning has long been fundamental to various fields of computer science, including AI in its early days. In contrast, large language models (LLMs)—the cornerstone of modern AI—perform reasoning through autoregressive next-word prediction, without grounding their outputs in formal systems. This “informal” approach can learn world knowledge and reasoning patterns from large-scale data without rigid formalization. It offers significantly greater flexibility than traditional formal reasoning and has achieved promising results on many benchmarks. However, LLMs heavily rely on data and do not guarantee the soundness of reasoning. In this article, we highlight recent efforts to integrate modern LLMs with formal methods, an approach that seeks to harness the strengths of both paradigms. Such integration has the potential to lead to major advancements in AI-driven mathematics, formal verification, and the verifiable generation of computer systems.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Yang, K., Poesia, G., He, J., Li, W., Lauter, K., Chaudhuri, S., & Song, D. X. (2026). Formal Reasoning Meets LLMs: Toward AI for Mathematics and Verification. Communications of the ACM, 69(3), 66–73. https://doi.org/10.1145/3750038

MLA 9

Yang, Kaiyu, et al. “Formal Reasoning Meets LLMs: Toward AI for Mathematics and Verification.” Communications of the ACM, vol. 69, no. 3, 2026, pp. 66–73. https://doi.org/10.1145/3750038.

Chicago

Yang, Kaiyu, Gabriel Poesia, Jingxuan He, Wenda Li, Kristin Lauter, Swarat Chaudhuri, and Dawn Xiaodong Song. 2026. “Formal Reasoning Meets LLMs: Toward AI for Mathematics and Verification.” Communications of the ACM 69 (3): 66–73. https://doi.org/10.1145/3750038.

Harvard

Yang, K. et al. (2026) ‘Formal Reasoning Meets LLMs: Toward AI for Mathematics and Verification’, Communications of the ACM, 69(3), pp. 66–73. doi:10.1145/3750038.

IEEE

K. Yang et al., “Formal Reasoning Meets LLMs: Toward AI for Mathematics and Verification,” Communications of the ACM, vol. 69, no. 3, pp. 66–73, 2026, doi: 10.1145/3750038.

BibTeX

@article{yang2026formal,
  title     = {{Formal Reasoning Meets LLMs: Toward AI for Mathematics and Verification}},
  author    = {Yang, Kaiyu and Poesia, Gabriel and He, Jingxuan and Li, Wenda and Lauter, Kristin and Chaudhuri, Swarat and Song, Dawn Xiaodong},
  journal   = {Communications of the ACM},
  year      = {2026},
  volume    = {69},
  number    = {3},
  pages     = {66--73},
  doi       = {10.1145/3750038},
  url       = {https://doi.org/10.1145/3750038}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Software › Logic, programming, and type systems

  • large language models
  • formal reasoning
  • formal methods
  • formal verification

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Yang, K., Poesia, G., He, J., Li, W., Lauter, K., Chaudhuri, S., & Song, D. X. (2026). Formal Reasoning Meets LLMs: Toward AI for Mathematics and Verification. Communications of the ACM, 69(3), 66–73. https://doi.org/10.1145/3750038

How many times has this paper been cited?

11 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Communications of the ACM: sign in and open the full text from this page.

Who wrote this paper?

Kaiyu Yang, Gabriel Poesia, Jingxuan He, Wenda Li, Kristin Lauter, Swarat Chaudhuri, Dawn Xiaodong Song.

What is the DOI of this paper?

10.1145/3750038, permanently at https://doi.org/10.1145/3750038. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.