arXiv (All)
open access
TreeThink: A Modular Tree Search Library for Mathematical Reasoning with LLMs
Tree search algorithms enable systematic exploration of the proof space in neural theorem proving. Existing LLM tree search libraries primarily target natural language reasoning and do not provide native integration with formal verifiers, while theorem proving systems often rely on task-specific sea
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
- On Reasoning-Centric LLM-based Automated Theorem Proving#124126
- MechMath: Sorrifier-Driven Formal Decomposition Workflow for Automated Theorem Proving#614966
- MechMath: Sorrifier-Driven Formal Decomposition Workflow for Automated Theorem Proving#613999
- Solving Every Step Is Not Enough: Milestone Oracles Reveal a Composition Gap in LLM Math Reasoning#1116566
- Official Review · ICLR 2026#787116
Record · ID 986889
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