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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
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
Highly Cited
2006
Highly Cited
2006
  • Wenjun Wu
  • Journal of Automated Reasoning
  • 2006
  • Corpus ID: 35182366
At the end of 1976 and the beginning of 1977, the author discovered a mechanical method for proving theorems in elementary… Expand
Highly Cited
2004
Highly Cited
2004
Deduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congruence on propositions. Such a… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
2001
Highly Cited
2001
Lifting is one of the most important general techniques for accelerating dii-cult computations. Lifting was used by Alan Robinson… Expand
Highly Cited
1996
Highly Cited
1996
  • M. Fitting
  • Graduate Texts in Computer Science
  • 1996
  • 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
Highly Cited
1987
Highly Cited
1987
  • W. Bibel
  • Artificial Intelligence / Künstliche Intelligenz
  • 1987
  • Corpus ID: 31549660
I. Natural and formal logic.- II. The connection method in propositional logic.- III. The connection method in first-order logic… Expand
  • table 3
  • figure 1
  • figure 2
  • table 3
  • figure 1
Highly Cited
1986
Highly Cited
1986
We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a… Expand
Highly Cited
1981
Highly Cited
1981
  • N. Nilsson
  • IEEE Transactions on Pattern Analysis and Machine…
  • 1981
  • Corpus ID: 20370792
A classic introduction to artificial intelligence intended to bridge the gap between theory and practice, "Principles of… Expand
  • figure 1.1
  • figure 2.1
  • figure 2.2
  • figure 3.2
  • figure 3.3
Highly Cited
1980
Highly Cited
1980
  • R. Reiter
  • Artif. Intell.
  • 1980
  • Corpus ID: 16338450
The need to make default assumptions is frequently encountered in reasoning about incompletely specified worlds. Inferences… Expand
  • figure 1
  • figure 4
Highly Cited
1971
Highly Cited
1971
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