https://github.com/BartoszPiotrowski/guiding-connection-tableau-by-RNNs
공식 코드Guiding Inferences in Connection Tableau by Recurrent Neural Networks
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
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
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
Guiding Inferences in Connection Tableau by Recurrent Neural Networks
Goedel-Prover: A Frontier Model for Open-Source Automated Theorem Proving
A Deep Reinforcement Learning Approach to First-Order Logic Theorem Proving
Neural Theorem Provers Do Not Learn Rules Without Exploration
Measuring Systematic Generalization in Neural Proof Generation with Transformers
TheoremLlama: Transforming General-Purpose LLMs into Lean4 Experts
Learning Rules Explaining Interactive Theorem Proving Tactic Prediction
INT: An Inequality Benchmark for Evaluating Generalization in Theorem Proving
Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs
Logically Consistent Adversarial Attacks for Soft Theorem Provers
A Survey on Mathematical Reasoning and Optimization with Large Language Models
Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic
Lyra: Orchestrating Dual Correction in Automated Theorem Proving
An Empirical Study of Data Ability Boundary in LLMs' Math Reasoning
An energy-based model for neuro-symbolic reasoning on knowledge graphs
Holophrasm: a neural Automated Theorem Prover for higher-order logic
MUSTARD: Mastering Uniform Synthesis of Theorem and Proof Data
ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics
Parsel: Algorithmic Reasoning with Language Models by Composing Decompositions
Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs
FVEL: Interactive Formal Verification Environment with Large Language Models via Theorem Proving
On the (In)feasibility of ML Backdoor Detection as an Hypothesis Testing Problem
Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.