arXiv:2303.05854
공식 코드 · Papers with Code
Lemmas: Generation, Selection, Application
원문 초록
Noting that lemmas are a key feature of mathematics, we engage in an investigation of the role of lemmas in automated theorem proving. The paper describes experiments with a combined system involving learning technology that generates useful lemmas for automated theorem provers, demonstrating improvement for several representative systems and solving a hard problem not solved by any system for twenty years. By focusing on condensed detachment problems we simplify the setting considerably, allowing us to get at the essence of lemmas and their role in proof search.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.