arXiv (All)
open access
SCOPE: Certified Theorem Proving with a Language Model as the Policy Planner
In proof assistants such as Lean, a generated proof must pass machine compilation checks, so evaluation needs no human scoring. Direct generation fails on multi-step numeric propositions: a proof is valid only if every content integer is correct, so the pass rate is bounded by the k-th power of the
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
- Viva La Vida: Verification and Accumulation Failures in Multi-Agent Proof Search#1200480
- TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability#793841
- Do Theorem Provers Need Theorem-Proving Agents? mini-Lean-agent: A Coding-Agent Baseline for Lean#1342207
- Cost-Effective Automated Judging of Natural-Language Mathematical Proofs#1201023
- ACED-Bench: Evaluating How LLM Agents Acquire and Act on Causal Evidence#1325277
Record · ID 1218054
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