View source for Theorem prover

{{TEX|done}}
''automated deduction tool''

Software that helps in solving problems and answering questions that involve reasoning. Such assistance comes in two modes: interactive, where one instructs the program to draw some conclusions, present them to the user, and then to ask for a new set of instructions; or fully automatic, where the program is assigned an entire reasoning task.

Automated deduction stands for the automated processing of a variety of reasoning tasks: consequence proving, counterexample generation, model checking, subsumption checking, and satisfiability checking. Application areas of automated deduction include mathematics, program and hardware verification, planning, diagnosis, mathematics and logic education, databases, knowledge representation, and natural language processing.

Some of the main achievements of automated deduction systems include:

proving the Robbins algebra conjecture;

the verification of communications networks too complex for human analysis;

some complete commercial microcontrollers, parts of commercial microprocessors, and their key algorithms have been verified mechanically, although the largest commercial chips are not verifiable using automated deduction tools at present (1998) and probably in the near future;

a number of programming languages are built around deductive methods;

recent (1998) novel uses of automated deduction tools include areas such as economics and sociology; these can profit from the use of (automated) formal methods to express and evaluate theories, for example by testing the consistency of a proposed theory extension and by generating ramifications of a proposed extension.

Theorem-proving tools are built around deduction systems. Resolution-based theorem provers are the most successful ones; the underlying resolution calculus is originally due to J.A. Robinson [[#References|[a12]]]. Other, less popular deduction formats for theorem proving are based on the so-called tableaux method (due to E.W. Beth [[#References|[a3]]]) and on sequent-based calculi (originally due to G. Gentzen [[#References|[a4]]]).

Automated deduction tools are complex pieces of software. The strength of such tools crucially depends on appropriate representation and indexing techniques and memory management. Today's (1998) resolution-based theorem provers explore search spaces of several billion clauses, and advanced model checking software is able to represent complex computational systems with as much as $10^{1300}$ many possible states.

Some of the better known provers include Gandalf [[#References|[a13]]], Isabelle [[#References|[a10]]], NQHTM (also known as the [[Boyer–Moore theorem prover|Boyer–Moore theorem prover]]; [[#References|[a1]]]), OTTER [[#References|[a15]]], and SPASS [[#References|[a14]]]; these are all resolution-based systems. Tableaux-based systems include SETHEO [[#References|[a8]]], a well-know sequent-based system is the Logics Workbench LWB [[#References|[a5]]], and a well-known model checker is SMV [[#References|[a9]]]. There are several specialized journals in the area (see [[#References|[a6]]], [[#References|[a7]]]) as well as two handbooks (as of 1998) [[#References|[a2]]], [[#References|[a11]]].

====References====
<table><TR><TD valign="top">[a1]</TD> <TD valign="top">  R.S. Boyer,   J.S. Moore,   "A computational logic" , Acad. Press  (1979)</TD></TR><TR><TD valign="top">[a2]</TD> <TD valign="top">  "Automated deduction: A basis for applications"  W. Bibel (ed.)  P.H. Schmidt (ed.) , ''Applied Logic Ser.'' , Kluwer Acad. Publ.  (1998)</TD></TR><TR><TD valign="top">[a3]</TD> <TD valign="top">  E.W. Beth,   "Semantic entailment and formal derivability"  ''Meded. K. Nederl. Akad. Wetensch., Afd. Letterkunde, N.R.'' , '''18''' :  13  (1955)  pp. 309–342</TD></TR><TR><TD valign="top">[a4]</TD> <TD valign="top">  G. Gentzen,   "Untersuchungen über das logische Schließen"  ''Math. Z.'' , '''39'''  (1935)  pp. 176–210; 405–431</TD></TR><TR><TD valign="top">[a5]</TD> <TD valign="top">  A. Heuerding,   "LWB theory: information about some propositional logics via the WWW"  ''J. IGPL'' , '''4''' :  4  (1996)  pp. 169–174</TD></TR><TR><TD valign="top">[a6]</TD> <TD valign="top">  ''J. Automated Reasoning''  (0)</TD></TR><TR><TD valign="top">[a7]</TD> <TD valign="top">  ''J. Symbolic Comp.''  (1)</TD></TR><TR><TD valign="top">[a8]</TD> <TD valign="top">  M. Moser,   O. Ibens,   R. Letz,   J. Steinbach,   C. Goller,   J. Schumann,   K. Mayr,   "SETHEO and E-SETHEO. The Cade-13 systems"  ''J. Automated Reasoning'' , '''18''' :  2  (1997)  pp. 237–246</TD></TR><TR><TD valign="top">[a9]</TD> <TD valign="top">  K. McMillan,   "Symbolic model checking" , Kluwer Acad. Publ.  (1993)</TD></TR><TR><TD valign="top">[a10]</TD> <TD valign="top">  L.C. Paulson,   "Isabelle: a generic theorem prover" , ''Lecture Notes Computer Sci.'' , '''828''' , Springer  (1994)</TD></TR><TR><TD valign="top">[a11]</TD> <TD valign="top">  "Handbook of Automated Reasoning"  J.A. Robinson (ed.)  A. Voronkov (ed.) , Elsevier  (1999)</TD></TR><TR><TD valign="top">[a12]</TD> <TD valign="top">  J.A. Robinson,   "A machine-oriented logic based on the resolution principle"  ''J. ACM'' , '''12'''  (1965)  pp. 23–41</TD></TR><TR><TD valign="top">[a13]</TD> <TD valign="top">  T. Tammet,   "Towards efficient subsumption" , ''Proc. CADE-15'' , ''Lecture Notes Computer Sci.'' , '''1421''' , Springer  (1998)</TD></TR><TR><TD valign="top">[a14]</TD> <TD valign="top">  C. Weidenbach,   B. Gaede,   G. Rock,   "SPASS &amp; FLOTTER, Version 0.42" , ''Proc. CADE-13'' , Springer  (1996)</TD></TR><TR><TD valign="top">[a15]</TD> <TD valign="top">  L. Wos,   R. Overbeek,   E. Lusk,   J. Boyle,   "Automated reasoning: Introduction and applications" , McGraw-Hill  (1992)  (Edition: Second)</TD></TR></table>