Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving 事件

Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving arXiv:2503.11657v3 Announce Type: replace Abstract: Large language models have demonstrated remarkable capabilities in natural language processing tasks requiring multi-step logical reasoning capabilities, such as automated theorem proving. However, challenges persist within theorem proving, such as the identification of key mathematical concepts, understanding their interrelationships, and formalizing proofs c