No article text was recorded for this version.
hierarchical proof decomposition
Version 1 of 155 papers73 conceptsfrozen 2026-10-04
Papers in this version
- Blog: SubgoalXL: Subgoal-based Expert Learning for Theorem Proving
- Blog: FormalML: A Benchmark for Evaluating Formal Subgoal Completion in Machine Learning Theory
- Blog: From Informal to Formal - Incorporating and Evaluating LLMs on Natural Language Requirements to Verifiable Formal Proofs
- Blog: ProofCompass: Enhancing Specialized Provers with LLM Guidance
- Blog: From Scientific Texts to Verifiable Code: Automating the Process with Transformers
- Blog: Proving Theorems Recursively
- Blog: Lemur: Integrating Large Language Models in Automated Program Verification
- Blog: Datapath Verification via Word-Level E-Graph Rewriting
- Blog: BC-Prover: Backward Chaining Prover for Formal Theorem Proving
- Blog: On Proving Laws of the Algebra of FP-Systems in Edinburgh LCF
- Blog: Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving
- Blog: ProofFlow: A Dependency Graph Approach to Faithful Proof Autoformalization
- Blog: APOLLO: Automated LLM and Lean Collaboration for Advanced Formal Reasoning
- Blog: Subgoal-based Demonstration Learning for Formal Theorem Proving
- Blog: Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs
- Blog: A Lean Dataset for International Math Olympiad: Small Steps towards Writing Math Proofs for Hard Problems
- Blog: Hilbert: Recursively Building Formal Proofs with Informal Reasoning
- Blog: Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations
- Blog: Dissect-and-Restore: AI-based Code Verification with Transient Refactoring
- Blog: Lemur: Integrating Large Language Models in Automated Program Verification
- Blog: A Man-Machine Theorem-Proving System
- Blog: Learning Formal Mathematics From Intrinsic Motivation
- Blog: Aristotle: IMO-level Automated Theorem Proving
- Blog: SC-TPTP: An Extension of the TPTP Derivation Format for Sequent-Based Calculus
- Blog: MechMath: Sorrifier-Driven Formal Decomposition Workflow for Automated Theorem Proving
- Blog: Rough Resolution: A Refinement of Resolution to Remove Large Literals
- Blog: LEGO-Prover: Neural Theorem Proving with Growing Libraries
- Blog: Proof Methods in an Agenda-Based Natural-Deduction Theorem Prover
- Blog: Sift: Using Refinement-guided Automation to Verify Complex Distributed Systems
- Blog: Generating Millions Of Lean Theorems With Proofs By Exploring State Transition Graphs
- Blog: Pessimistic Verification for Open-Ended Math Questions
- Blog: Introduction to Milestones in Interactive Theorem Proving
- Blog: Knowledge Based Approach for Mechanically Verifying Security Protocols
- Blog: Explicit Planning Helps Language Models in Logical Reasoning
- Blog: Editable Proof Sketch for Automated Theorem Proving
- Blog: O-Forge: An LLM + Computer Algebra Framework for Asymptotic Analysis
- Blog: Tool-Assisted Multi-Turn Theorem Proving with LLMs
- Blog: Bootstrapping Hierarchical Autoregressive Formal Reasoner with Chain-of-Proxy-Autoformalization
- Blog: ProofOptimizer: Training Language Models to Simplify Proofs without Human Demonstrations
- Blog: Quokka: Accelerating Program Verification with LLMs via Invariant Synthesis
- Blog: Why Agentic Theorem Prover Works: A Statistical Provability Theory of Mathematical Reasoning Models
- Blog: Formalization of QFT: Osterwalder–Schrader Axioms for the Free Field in Lean 4
- Blog: Computer Proofs of Limit Theorems
- Blog: ATLAS: Autoformalizing Theorems through Lifting, Augmentation, and Synthesis of Data
- Blog: AXLE: A Cloud Infrastructure for Lean 4 Theorem Proving Utilities
- Blog: PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competition
- Blog: miniF2F-Dafny: LLM-Guided Mathematical Theorem Proving via Auto-Active Verification
- Blog: Hierarchical Decompositions and Termination Analysis for Generalized Planning
- Blog: Escaping the Cognitive Well: Efficient Competition Math with Off-the-Shelf Models
- Blog: SL-VC: A Benchmark and Automated Framework for Separation Logic Verification Condition Proving
- Blog: Formal Theorem Proving by Rewarding LLMs to Decompose Proofs Hierarchically
- Blog: Gentzen-Type Formal System Representing Properties
- Blog: Learning to Prove with Tactics
- Blog: Formal Grammars as Models of Logic Derivations
- Blog: Seed-Prover 1.5: Mastering Undergraduate-Level Theorem Proving via Learning from Experience
History & citation
Current · Permanent link
- This direction split from Recursive Subgoal Decomposition for Automated Formal Verification (82% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_hierarchical_proof_decomposition_cc9d5721,
title = {hierarchical proof decomposition},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/hierarchical-proof-decomposition/rdr_cc9d5721545c458a9aba6931e340ddf3},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_hierarchical_proof_decomposition_cc9d5721_v1,
title = {hierarchical proof decomposition},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/hierarchical-proof-decomposition/rdr_cc9d5721545c458a9aba6931e340ddf3/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}