Papers with Code 아카이브
Automated Theorem Proving
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 9
- 보존된 평가 기록
- 63
The goal of Automated Theorem Proving is to automatically generate a proof, given a conjecture (the target theorem) and a knowledge base of known facts, all expressed in a formal language. Automated Theorem Proving is useful in a wide range of applications, including the verification and synthesis of software and hardware systems.
Source: Learning to Prove Theorems by Learning to Generate Theorems
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Prover Agent: An Agent-based Framework for Formal Mathematical Proofs
Towards Advanced Mathematical Reasoning for LLMs via First-Order Logic Theorem Proving
MATP-BENCH: Can MLLM Be a Good Automated Theorem Prover for Multimodal Problems?
Safe: Enhancing Mathematical Reasoning in Large Language Models via Retrospective Step-aware Formal Verification
LeanExplore: A search engine for Lean 4 declarations
Rewarding the Unlikely: Lifting GRPO Beyond Distribution Sharpening
ProofNet++: A Neuro-Symbolic System for Formal Proof Verification with Self-Correction
Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations
Autoformalization in the Era of Large Language Models: A Survey
DeepTheorem: Advancing LLM Reasoning for Theorem Proving Through Natural Language and Reinforcement Learning
RocqStar: Leveraging Similarity-driven Retrieval and Agentic Systems for Rocq generation
Enumerate-Conjecture-Prove: Formally Solving Answer-Construction Problems in Math Competitions
MIRB: Mathematical Information Retrieval Benchmark
HybridProver: Augmenting Theorem Proving with LLM-Driven Proof Synthesis and Refinement
Ineq-Comp: Benchmarking Human-Intuitive Compositional Reasoning in Automated Theorem Proving on Inequalities
LLM-based Automated Theorem Proving Hinges on Scalable Synthetic Data Generation
MPS-Prover: Advancing Stepwise Theorem Proving by Multi-Perspective Search and Data Curation
APOLLO: Automated LLM and Lean Collaboration for Advanced Formal Reasoning
Beyond Theorem Proving: Formulation, Framework and Benchmark for Formal Problem-Solving
Proceedings The 13th International Workshop on Theorem proving components for Educational software
DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition
The Limits of AI Explainability: An Algorithmic Information Theory Approach
APE-Bench I: Towards File-level Automated Proof Engineering of Formal Math Libraries
Hua-Chen New Theory of Economic Optimization
Hierarchical Attention Generates Better Proofs
Neural Theorem Proving: Generating and Structuring Proofs for Formal Verification
Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning
Reasoning Models Can Be Effective Without Thinking
Enhancing Mathematical Reasoning in Large Language Models with Self-Consistency-Based Hallucination Detection
Leanabell-Prover: Posttraining Scaling in Formal Reasoning
Reasoning Under Threat: Symbolic and Neural Techniques for Cybersecurity Verification
A Survey on Mathematical Reasoning and Optimization with Large Language Models
Vulnerability Detection: From Formal Verification to Large Language Models and Hybrid Approaches: A Comprehensive Overview
Local Look-Ahead Guidance via Verifier-in-the-Loop for Automated Theorem Proving
Efficient Neural Clause-Selection Reinforcement
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.