Autoformalization is the process of automatically translating from natural language
mathematics to formal specifications and proofs. A successful autoformalization system …

Automated theorem provers and formal proof assistants are general reasoning systems that
are in theory capable of proving arbitrarily hard theorems, thus solving arbitrary problems …

With the ever-increasing hardware design complexity comes the realization that efforts
required for hardware verification increase at an even faster rate. Driven by the push from …

This work studies a central extremal graph theory problem inspired by a 1975 conjecture of
Erd\H {o} s, which aims to find graphs with a given size (number of nodes) that maximize the …

An Empirical Assessment of Progress in Automated Theorem Proving | SpringerLink Skip to
main content Advertisement SpringerLink Account Menu Find a journal Publish with us Track …

Premise selection is crucial for large theory reasoning with automated theorem provers as
the sheer size of the problems quickly leads to resource exhaustion. This paper proposes a …

A fundamental challenge in formal theorem proving by LLMs is the lack of high-quality
training data. Although reinforcement learning or expert iteration partially mitigates this issue …

Mathematics olympiads are prestigious competitions, with problem proposing and solving
highly honored. Building artificial intelligence that proposes and solves olympiads presents …

Using reinforcement learning for automated theorem proving has recently received much
attention. Current approaches use representations of logical statements that often rely on the …

Human mathematicians are often good at recognizing modular and reusable theorems that
make complex mathematical results within reach. In this paper, we propose a novel method …