Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Automated theorem proving

Known as: Automatic proof system, Automatic theorem proving, List of automated theorem provers 
Automated theorem proving (also known as ATP or automated deduction) is a subfield of automated reasoning and mathematical logic dealing with proving… Expand
Wikipedia

Related topics

Related topics

50 relations
ACM Turing AwardAlgebraic normal formAutomated proof checkingCADE ATP System Competition
Expand

Broader (1)

Formal methods

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description)
KeYmaera is a hybrid verification tool for hybrid systems that combines deductive, real algebraic, and computer algebraic prover… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Simplify: a theorem prover for program checking
This article provides a detailed description of the automatic theorem prover Simplify, which is the proof engine of the Extended… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
E - a brainiac theorem prover
We describe the superposition-based theorem prover E. E is a sound and complete prover for clausal first order logic with… Expand
  • figure 1
  • table 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Resolution Theorem Proving
Lifting is one of the most important general techniques for accelerating dii-cult computations. Lifting was used by Alan Robinson… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Isabelle: A Generic Theorem Prover
Foundations.- Getting started with Isabelle.- Advanced methods.- Basic use of Isabelle.- Proof management: The subgoal module… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Rewrite-Based Equational Theorem Proving with Selection and Simplification
We present various refutationally complete calculi for first-order clauses with equality that allow for arbitrary selection of… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
First-Order Logic and Automated Theorem Proving
  • Melvin Fitting
  • Graduate Texts in Computer Science
  • 1990
    • Corpus ID: 10411039
This monograph on classical logic presents fundamental concepts and results in a rigorous mathematical style. Applications to… Expand
  • table 2.1
  • table 2.2
  • figure 2.1
  • table 2.3
  • table 2.4
Is this relevant?
Highly Cited
1973
Highly Cited
1973
Symbolic logic and mechanical theorem proving
This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving its applications… Expand
Is this relevant?
Highly Cited
1971
Highly Cited
1971
STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving
We describe a new problem solver called STRIPS that attempts to find a sequence of operators in a space of world models to… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1969
Highly Cited
1969
Application of Theorem Proving to Problem Solving
This paper shows how an extension of the resolution proof procedure can be used to construct problem solutions. The extended… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE