Automated theorem proving

From Free net encyclopedia

Automated theorem proving (currently the most important subfield of automated reasoning) is the proving of mathematical theorems by a computer program. Depending on the underlying logic, the problem of deciding the validity of a theorem varies from trivial to impossible. For the frequent case of propositional logic, the problem is decidable but NP-complete, and hence only exponential-time algorithms are believed to exist for general proving tasks. For first-order logic it is recursively enumerable, i.e., given unbounded resources, any valid theorem can eventually be proven. Invalid statements, i.e. formulas that are not entailed by a given theory, cannot always be recognized. In these cases, a first-order theorem prover may fail to terminate while searching for a proof. Despite these theoretical limits, practical theorem provers can solve many hard problems in these logics.

A simpler, but related problem is proof verification, where an existing proof for a theorem is certified valid. For this, it is generally required that each individual proof step can be verified by a primitive recursive function or program, and hence the problem is always decidable.

Interactive theorem provers require a human user to give hints to the system. Depending on the degree of automation, the prover can essentially be reduced to a proof checker, with the user providing the proof in a formal way, or significant proof tasks can be performed automatically. Interactive provers are used for a variety of tasks, but even fully automatic systems have by now proven a number of interesting and hard theorems, including some that have eluded human mathematicians for a long time. However, these successes are sporadic, and work on hard problems usually requires a proficient user.

Another distinction is sometimes drawn between theorem proving and other techniques, where a process is considered to be theorem proving if it consists of a traditional proof, starting with axioms and producing new inference steps using rules of inference. Other techniques would include model checking, which is equivalent to brute-force enumeration of many possible states (although the actual implementation of model checkers requires much cleverness, and does not simply reduce to brute force). There are hybrid theorem proving systems which use model checking as an inference rule. There are also programs which were written to prove a particular theorem, with a (usually informal) proof that if the program finishes with a certain result, then the theorem is true. A good example of this was the machine-aided proof of the four color theorem, which was very controversial as the first claimed mathematical proof which was essentially impossible to verify by humans due to the enormous size of the program's calculation (such proofs are called non-surveyable proofs). Another example would be the proof that the game Connect Four is a win for the first player.

Commercial use of automated theorem proving is mostly concentrated in integrated circuit design and verification. Since the Pentium FDIV bug, the complicated floating point units of modern microprocessors have been designed with extra scrutiny. In the latest processors from AMD, Intel, and others, automated theorem proving has been used to verify that division and other operations are correct.

Contents

[edit]

First-order theorem proving

First-order theorem proving is one of the most mature subfields of automated theorem proving. The logic is expressive enough to allow the specification of arbitrary problems, often in a reasonably natural and intuitive way. On the other hand, it is still semi-decidable, and a number of sound and complete calculi have been developed, enabling fully automated systems. The quality of implemented system has benefited by the existence of a large library of standard benchmark examples (the TPTP), as well as by the CADE ATP System Competition (CASC), a yearly competition of first-order systems for many important classes of first-order problems.

Some important systems (all have won at least one CASC competition division) are listed below.

[edit]

Popular techniques

[edit]

Available implementations

You can find information on some of these theorem provers and others at http://www.tptp.org/CASC/J2/SystemDescriptions.html, or the QPQ website. The TPTP library of test problems, suitable for testing first-order theorem provers, is available at http://www.tptp.org, and solutions from many of these provers for TPTP problems are in the TSTP solution library, available at http://www.tptp.org/TSTP .

[edit]

Important people

[edit]

References (books)

  • {{cite book 
| title = Symbolic Logic and Mechanical Theorem Proving
| author = Chin-Liang Chang
| coauthors = Richard Char-Tung Lee
| publisher = Academic Press
| year = 1973

}}

  • {{cite book 
| last = Loveland
| first = Donald W.
| title = Automated Theorem Proving: A Logical Basis. Fundamental Studies in Computer Science Volume 6
| publisher = North-Holland Publishing
| year = 1978

}}

  • {{cite book 
| last = Gallier
| first = Jean H.
| title = Logic for Computer Science: Foundations of Automatic Theorem Proving
| publisher = Harper & Row Publishers
| year = 1986
| url = http://www.cis.upenn.edu/~jean/gbooks/logic.html

}}

  • {{cite book 
| last = Duffy
| first = David A.
| title = Principles of Automated Theorem Proving
| year = 1991
| publisher = John Wiley & Sons

}}

  • {{cite book 
| last = Wos
| first = Larry
| coauthors = Overbeek, Ross; Lusk, Ewing; Boyle, Jim
| title = Automated Reasoning: Introduction and Applications
| edition = 2nd edition
| publisher = McGraw-Hill
| year = 1992

}}

  • {{cite book 
| title = Handbook of Automated Reasoning Volume I & II
| editor = Alan Robinson and Andrei Voronkov (eds.)
| publisher = Elsevier and MIT Press
| year = 2001

}}

[edit]

See also

Retrieved from "http://www.netipedia.com/index.php/Automated_theorem_proving"