Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

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

Broader (1)

Formal methods

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2000
2000
Automated Theorem Proving
1 A Brief Introduction to COMPILE, HERBY, and THEO.- 1.1 COMPILE.- 1.1.1 Creating an executable version of COMPILE.- 1.1.2… 
Review
1997
Review
1997
Design of embedded systems: formal models, validation, and synthesis
This paper addresses the design of reactive real-time embedded systems. Such systems are often heterogeneous in implementation… 
Review
1991
Review
1991
Principles of automated theorem proving
  • D. A. Duffy
  • Wiley professional computing
  • 1991
  • Corpus ID: 40944433
An overview of ATP techniques for the non-specialist, it discusses all the main approaches to proof: resolution, natural… 
Highly Cited
1987
Highly Cited
1987
Automated Theorem Proving
  • 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… 
Highly Cited
1986
Highly Cited
1986
Basic principles of mechanical theorem proving in elementary geometries
At the end of 1976 and the beginning of 1977, the author discovered a mechanical method for proving theorems in elementary… 
Highly Cited
1985
Highly Cited
1985
Logic for Computer Science: Foundations of Automatic Theorem Proving
This advanced text for undergraduate and graduate students introduces mathematical logic with an emphasis on proof theory and… 
Highly Cited
1982
Highly Cited
1982
Contributions to the Theory of Logic Programming
Hom clauses of first-order predicate logic can be regarded as a high-level programming language when SLD-resolution, a special… 
Review
1982
Review
1982
Panel Data
We consider linear predictor definitions of noncausality or strict exogeneity and show that it is restrictive to assert that… 
Highly Cited
1978
Highly Cited
1978
Automated theorem proving: a logical basis
  • D. Loveland
  • Fundamental studies in computer science
  • 1978
  • Corpus ID: 11348601
Highly Cited
1968
Highly Cited
1968
A fixed point theorem of the alternative, for contractions on a generalized complete metric space
1. Summary. The purpose of this note is to prove a "theorem of the alternative" for any "contraction mapping" T on a "generalized… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)