Automated theorem proving (also known as ATP or automated deduction) is a subfield of automated reasoning and mathematical logic dealing with provingâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2009

2009

- Stephan Schiffel, Michael Thielscher
- IJCAI
- 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)

Is this relevant?

2005

2005

- Thomas Ball, Shuvendu K. Lahiri, Madan Musuvathi
- LPAR
- 2005

Automated theorem provers (ATPs) are a key component that many software verification and program analysis tools rely on. Howeverâ€¦Â (More)

Is this relevant?

2005

2005

- Geoff Sutcliffe
- AI Commun.
- 2005

The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first order Automated Theorem Proving systemsâ€¦Â (More)

Is this relevant?

2001

2001

- Monty Newborn
- 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

- Frank Pfenning
- 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

- Michael Kohlhase
- 1998

The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systemsâ€¦Â (More)

Is this relevant?

1993

1993

- Dominique Pastre
- Annals of Mathematics and Artificial Intelligence
- 1993

TheMuscadet theorem prover is a knowledge-based system able to prove theorems in some non-trivial mathematical domains. Theâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Melvin Fitting
- Texts and Monographs in Computer Science
- 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

- Charles G. Morgan
- IEEE Transactions on Computers
- 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

- James R. Slagle
- J. ACM
- 1974

To prove really difficult theorems, resolution principle programs need to make better inferences and to make them faster. Anâ€¦Â (More)

Is this relevant?