Progress in Automated Theorem Proving , 1997 – 1999

Despite some impressive individual achievements, the extreme difficulty of Automated Theorem Proving (ATP) means that progress in ATP is slow relative to, e.g., some aspects of commercial information technology. The (relatively) slow progress has two distinct disadvantages. First, for the researchers, it is difficult to determine if a direction of investigation is making a meaningful contribution. Second, for unaware observers, a lack of progress leads to a loss of interest and confidence in the field. A serious outcome of this loss of interest and confidence has been the withdrawal of significant funding for ATP research. In this context of slow progress, it is important that progress in ATP be measured, monitored, and recognized. This paper presents quantitative measures that show progress in ATP, from mid-1997 to the end of 1999. The measures are based on collected performance data from ATP systems.

[1]  W. Bibel,et al.  Automated deduction : a basis for applications , 1998 .

[2]  I. V. Ramakrishnan,et al.  Term Indexing , 1995, Lecture Notes in Computer Science.

[3]  Geoff Sutcliffe,et al.  Smart Selective Competition Parallelism ATP , 1999, FLAIRS Conference.

[4]  Kenneth Kunen,et al.  Quasigroups, Loops, and Associative Laws , 1996 .

[5]  Larry Wos,et al.  Subsumption, a Sometimes Undervalued Procedure , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[6]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[7]  Geoff Sutcliffe,et al.  Evaluating general purpose automated theorem proving systems , 2001, Artif. Intell..

[8]  Donald W. Loveland,et al.  Automated Deduction: Looking Ahead , 1999, AI Mag..

[9]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[10]  Donald W. Loveland,et al.  A Simplified Format for the Model Elimination Theorem-Proving Procedure , 1969, J. ACM.

[11]  Geoff Sutcliffe,et al.  Homogeneous Sets of ATP Problems , 2002, FLAIRS.

[12]  Matt Kaufmann.  ACL2 support for verification projects , 1998 .

[13]  David A. Plaisted.  The Search Efficiency of Theorem Proving Strategies , 1994, CADE.

[14]  Masayuki Fujita,et al.  Automatic Generation of Some Results in Finite Algebra , 1993, IJCAI.

[15]  Reinhold Letz.  On the Polynomial Transparency of Resolution , 1993, IJCAI.

[16]  L. Wos,et al.  Paramodulation and Theorem-Proving in First-Order Theories with Equality , 1983 .

[17]  Wolfgang Reif,et al.  The KIV-Approach to Software Verification , 1995, KORSO Book.

[18]  Wayne Snyder,et al.  Basic Paramodulation and Superposition , 1992, CADE.

[19]  Ewing L. Lusk,et al.  Controlling Redundancy in Large Search Spaces: Argonne-Style Theorem Proving Through the Years , 1992, LPAR.

[20]  William McCune,et al.  Automated Deduction in Equational Logic and Cubic Curves , 1996, Lecture Notes in Computer Science.

[21]  Mark E. Stickel,et al.  A Prolog Technology Theorem Prover: A New Exposition and Implementation in Prolog , 1990, Theor. Comput. Sci..

[22]  Larry Wos,et al.  The Concept of Demodulation in Theorem Proving , 1967, JACM.

[23]  Geoff Sutcliffe,et al.  ATP System Results for the TPTP Problem Library , 1995 .