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
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Training a First-Order Theorem Prover from Synthetic Data
TacticZero: Learning to Prove Theorems from Scratch with Deep Reinforcement Learning
Proof Artifact Co-training for Theorem Proving with Language Models
Learning Equational Theorem Proving
Learning to Match Mathematical Statements with Proofs
A Study of Continuous Vector Representationsfor Theorem Proving
A Curious New Result of Resolution Strategies in Negation-Limited Inverters Problem
Learning as Abduction: Trainable Natural Logic Theorem Prover for Natural Language Inference
Proceedings 9th International Workshop on Theorem Proving Components for Educational Software
Measuring Systematic Generalization in Neural Proof Generation with Transformers
Deriving Theorems in Implicational Linear Logic, Declaratively
Proceedings 36th International Conference on Logic Programming (Technical Communications)
Generative Language Modeling for Automated Theorem Proving
INT: An Inequality Benchmark for Evaluating Generalization in Theorem Proving
Modelling Value-oriented Legal Reasoning in LogiKEy
Logical Neural Networks
Learning to Prove from Synthetic Theorems
Towards United Reasoning for Automatic Induction in Isabelle/HOL
Logical Inferences with Comparatives and Generalized Quantifiers
Towards Concise, Machine-discovered Proofs of Gödel's Two Incompleteness Theorems
Simple Dataset for Proof Method Recommendation in Isabelle/HOL (Dataset Description)
Prolog Technology Reinforcement Learning Prover
Towards a Geometry Automated Provers Competition
Proceedings 8th International Workshop on Theorem Proving Components for Educational Software
Learning to Prove Theorems by Learning to Generate Theorems
An Experimental Study of Formula Embeddings for Automated Theorem Proving in First-Order Logic
On Quantified Modal Theorem Proving for Modeling Ethics
Property Invariant Embedding for Automated Reasoning
Improving Graph Neural Network Representations of Logical Formulae with Subgraph Pooling
Aplib: Tactical Programming of Intelligent Agents
A Deep Reinforcement Learning Approach to First-Order Logic Theorem Proving
G2SAT: Learning to Generate SAT Formulas
Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic
CSPLib: Twenty Years On
Proceedings 35th International Conference on Logic Programming (Technical Communications)
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.