arXiv:1606.04442
DeepMath - Deep Sequence Models for Premise Selection
원문 초록
We study the effectiveness of neural sequence models for premise selection in automated theorem proving, one of the main bottlenecks in the formalization of mathematics. We propose a two stage approach for this task that yields good results for the premise selection task on the Mizar corpus while avoiding the hand-engineered features of existing state-of-the-art models. To our knowledge, this is the first time deep learning has been applied to theorem proving on a large scale.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
CriticLean: Critic-Guided Reinforcement Learning for Mathematical Formalization
Safe: Enhancing Mathematical Reasoning in Large Language Models via Retrospective Step-aware Formal Verification
LeanExplore: A search engine for Lean 4 declarations
Autoformalization in the Era of Large Language Models: A Survey
DeepTheorem: Advancing LLM Reasoning for Theorem Proving Through Natural Language and Reinforcement Learning
Enumerate-Conjecture-Prove: Formally Solving Answer-Construction Problems in Math Competitions
토론
이 논문과 연결된 포럼 글이 아직 없습니다.