KELPS: A Framework for Verified Multi-Language Autoformalization via Semantic-Syntactic Alignment
Not on the map. Why?
Abstract (arXiv)
Modern large language models (LLMs) show promising progress in formalizing informal mathematics into machine-verifiable theorems. However, these methods still face bottlenecks due to the limited quantity and quality of multilingual parallel corpora. In this paper, we propose a novel neuro-symbolic framework KELPS (Knowledge-Equation based Logical Processing System) to address these problems. KELPS is an iterative framework for translating, synthesizing, and filtering informal data into multiple formal languages (Lean, Coq, and Isabelle). First, we translate natural language into Knowledge Equations (KEs), a novel language that we designed, theoretically grounded in assertional logic. Next, we convert them to target languages through rigorously defined rules that preserve both syntactic structure and semantic meaning. This process yielded a parallel corpus of over 60,000 problems. Our framework achieves 88.9% syntactic accuracy (pass@1) on MiniF2F, outperforming SOTA models such as Deepseek-V3 (81%) and Herald (81.3%) across multiple datasets. All datasets and codes are available in the supplementary materials.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 20 of its 39 references that are in the map. First posted on arXiv 11 Jul 2025.
Builds on
20 of 39 references.
References · 20
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2021MiniF2F: a cross-system benchmark for formal Olympiad-level mathematicscited by 391
- 2022Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofscited by 291
- 2022Autoformalization with Large Language Modelscited by 263
- 2024Lean Workbook: A large-scale Lean problem set formalized from natural language math problemscited by 122
- 2023LEGO-Prover: Neural Theorem Proving with Growing Librariescited by 109
- 2024TheoremLlama: Transforming General-Purpose LLMs into Lean4 Expertscited by 59
- 2024Herald: A Natural Language Annotated Lean 4 Datasetcited by 59
- 2024Don't Trust: Verify -- Grounding LLM Quantitative Reasoning with Autoformalizationcited by 55
- 2018First Experiments with Neural Translation of Informal to Formal Mathematicscited by 53
- 2024MUSTARD: Mastering Uniform Synthesis of Theorem and Proof Datacited by 43
- 2023Multilingual Mathematical Autoformalizationcited by 39
8 more
- 2023Towards Autoformalization of Mathematics and Code Correctness: Experiments with Elementary Proofscited by 27
- 2024LEAN-GitHub: Compiling GitHub LEAN repositories for a versatile LEAN provercited by 25
- 2024FormalAlign: Automated Alignment Evaluation for Autoformalizationcited by 24
- 2025ATLAS: Autoformalizing Theorems through Lifting, Augmentation, and Synthesis of Datacited by 23
- 2023A New Approach Towards Autoformalizationcited by 10
- 2024GFLean: An Autoformalisation Framework for Lean via GFcited by 9
- 2024Lean4Lean: Verifying a Typechecker for Lean, in Leancited by 8
- 2025APE-Bench: Evaluating Automated Proof Engineering for Formal Math Librariescited by 7
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025StepFun-Formalizer: Unlocking the Autoformalization Potential of LLMs through Knowledge-Reasoning Fusion
- 2025Autoformalization in the Era of Large Language Models: A Survey
- 2024Autoformalize Mathematical Statements by Symbolic Equivalence and Semantic Consistency
- 2024Autoformalizing Natural Language to First-Order Logic: A Case Study in Logical Fallacy Detection
- 2026MathForm: Scaling Mathematical Autoformalization with Knowledge Retrieval and Verification-Guided Refinement
- 2025ReForm: Reflective Autoformalization with Prospective Bounded Sequence Optimization
- 2025FMC: Formalization of Natural Language Mathematical Competition Problems
- 2025FormalMATH: Benchmarking Formal Mathematical Reasoning of Large Language Models