arXiv CS
open access
Lean Graph Search for Formal Theorem Proving
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 depen
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Lean Graph Search for Formal Theorem Proving#1357994
- LEVER: Adaptive Cost-Aware Proof Search Over AND/OR Graphs#1249142
- On Reasoning-Centric LLM-based Automated Theorem Proving#124126
- Compiler-Guided Adaptive Proof Search with Cross-Model Synergy on Context-Dependent Theorem Proving#927427
- MechMath: Sorrifier-Driven Formal Decomposition Workflow for Automated Theorem Proving#614966
Record · ID 1348834
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive