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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1960-2017
010020019602017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
A general game player is a system that understands the rules of an unknown game and learns to play this game well without human… (More)
  • figure 2
  • figure 3
Is this relevant?
2005
2005
Automated theorem provers (ATPs) are a key component that many software verification and program analysis tools rely on. However… (More)
  • figure 1
  • figure 2
Is this relevant?
2005
2005
The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first order Automated Theorem Proving systems… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2001
2001
automated theorem proving theory and practice is available in our book collection an online access to it is set as public so you… (More)
Is this relevant?
1999
1999
Material for the course Automated Theorem Proving at Carnegie Mellon University, Fall 1999. This includes revised versions from… (More)
Is this relevant?
1998
1998
The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systems… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
TheMuscadet theorem prover is a knowledge-based system able to prove theorems in some non-trivial mathematical domains. The… (More)
  • figure 2
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Spend your time even for only few minutes to read a book. Reading a book will never reduce and waste your time to be useless… (More)
Is this relevant?
1976
1976
In this paper we outline two basic methods for automated theorem proving in nonclassical logics, including modal, many-valued… (More)
Is this relevant?
Highly Cited
1974
Highly Cited
1974
To prove really difficult theorems, resolution principle programs need to make better inferences and to make them faster. An… (More)
  • table I
  • figure I
  • table V
  • table VIII
  • table IX
Is this relevant?