Lean Graph Search for Formal Theorem Proving
Presents novel ML architecture with measurable improvements in automated theorem proving—critical for researchers working on formal verification and AI reasoning systems.
AI Summary
LeanGraphSearch improves theorem proving by using graph-based dependency chains to retrieve relevant lemmas, boosting recall by 12% and pass rates by up to 40% in formal verification benchmarks.
Excerpt
Retrieving relevant lemmas is crucial for formal theorem proving, enabling provers to build machine-checkable proofs from established mathematical results. Recent retrieval systems match library declarations to a target theorem or its intermediate proof steps, but make limited use of multi-hop dependencies among declarations. These dependencies can reveal supporting lemmas that are not necessarily lexically similar to the target theorem but recur in proofs of related problems. To this end, we pr
