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
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Blocking and Other Enhancements for Bottom-Up Model Generation Methods
BliStrTune: Hierarchical Invention of Theorem Proving Strategies
Monte Carlo Tableau Proof Search
DeepAlgebra - an outline of a program
Social Network Processes in the Isabelle and Coq Theorem Proving Communities
Verifier Theory and Unverifiability
Holophrasm: a neural Automated Theorem Prover for higher-order logic
DeepMath - Deep Sequence Models for Premise Selection
Extracting Higher-Order Goals from the Mizar Mathematical Library
GeoGebra Tools with Proof Capabilities
Analysis of Algorithms and Partial Algorithms
Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between Computational Time and Information Value
Towards Formal Fault Tree Analysis using Theorem Proving
GraATP: A Graph Theoretic Approach for Automated Theorem Proving in Plane Geometry
Performance Guarantees for Schatten-$p$ Quasi-Norm Minimization in Recovery of Low-Rank Matrices
Machine Learner for Automated Reasoning 0.4 and 0.5
Learning-assisted Theorem Proving with Millions of Lemmas
A state vector algebra for algorithmic implementation of second-order logic
HOL(y)Hammer: Online ATP Service for HOL Light
READ-EVAL-PRINT in Parallel and Asynchronous Proof-checking
Modeling in OWL 2 without Restrictions
Lectures on Jacques Herbrand as a Logician
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.