{"title":"Towards Automated Functional Equation Proving: A Benchmark Dataset and A Domain-Specific In-Context Agent","authors":"Mahdi Buali, Robert Hoehndorf","doi":"arxiv-2407.14521","DOIUrl":null,"url":null,"abstract":"Automated Theorem Proving (ATP) faces challenges due to its complexity and\ncomputational demands. Recent work has explored using Large Language Models\n(LLMs) for ATP action selection, but these methods can be resource-intensive.\nThis study introduces FEAS, an agent that enhances the COPRA in-context\nlearning framework within Lean. FEAS refines prompt generation, response\nparsing, and incorporates domain-specific heuristics for functional equations.\nIt introduces FunEq, a curated dataset of functional equation problems with\nvarying difficulty. FEAS outperforms baselines on FunEq, particularly with the\nintegration of domain-specific heuristics. The results demonstrate FEAS's\neffectiveness in generating and formalizing high-level proof strategies into\nLean proofs, showcasing the potential of tailored approaches for specific ATP\nchallenges.","PeriodicalId":501033,"journal":{"name":"arXiv - CS - Symbolic Computation","volume":"94 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Symbolic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.14521","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Automated Theorem Proving (ATP) faces challenges due to its complexity and
computational demands. Recent work has explored using Large Language Models
(LLMs) for ATP action selection, but these methods can be resource-intensive.
This study introduces FEAS, an agent that enhances the COPRA in-context
learning framework within Lean. FEAS refines prompt generation, response
parsing, and incorporates domain-specific heuristics for functional equations.
It introduces FunEq, a curated dataset of functional equation problems with
varying difficulty. FEAS outperforms baselines on FunEq, particularly with the
integration of domain-specific heuristics. The results demonstrate FEAS's
effectiveness in generating and formalizing high-level proof strategies into
Lean proofs, showcasing the potential of tailored approaches for specific ATP
challenges.