A Grand Challenge of Theorem Discovery

A primary mode of operation of ATP systems is to supply the system with axioms and a conjecture, and to then ask the system to produce a proof (or at least an assurance that there is a proof) that the conjecture is a theorem of the axioms. This paper challenges ATP to a new mode of operation, by which interesting theorems are generated from a set of axioms. The challenge requires solutions to both theoretical and computational issues.

[1]  Larry Wos,et al.  Short Single Axioms for Boolean Algebra , 2002, Journal of Automated Reasoning.

[2]  Simon Colton,et al.  A Multi-agent Approach to Modelling Interaction in Human Mathematical Reasoning , 2001 .

[3]  Johann Schumann,et al.  Automated Theorem Proving in Software Engineering , 2001, Springer Berlin Heidelberg.

[4]  Robin Milner,et al.  Grand Challenges for Computing Research , 2005, Comput. J..

[5]  Reiner Hähnle,et al.  Verification of Hardware Systems with First-Order Logic , 2002 .

[6]  M. Stickel,et al.  Automated reasoning and exhaustive search: Quasigroup existence problems☆ , 1995 .

[7]  Jian Zhang.  System Description: MCS: Model-based Conjecture Searching , 1999, CADE.

[8]  I. G. BONNER CLAPPISON.  Editor , 1960, The Electric Power Engineering Handbook - Five Volume Set.

[9]  Geoff Sutcliffe.  Progress in Automated Theorem Proving , 1997 – 1999 , 2000 .

[10]  Kahlil Hodgson.  Shortest Single Axioms for the Equivalential Calculus with CD and RCD , 2004, Journal of Automated Reasoning.

[11]  Jörg Denzinger,et al.  Recording and Analysing Knowledge-Based Distributed Deduction Processes , 1996, J. Symb. Comput..

[12]  MSc PhD Simon Colton BSc.  Automated Theory Formation in Pure Mathematics , 2002, Distinguished Dissertations.

[13]  Pat Langley,et al.  The Computer-Aided Discovery of Scientific Knowledge , 1998, Discovery Science.

[14]  MARC FUCHS,et al.  Controlled Use of Clausal Lemmas in Connection Tableau Calculi , 2000, J. Symb. Comput..

[15]  G Sutcliffe,et al.  The practice of clausification in automatic theorem proving , 1996 .

[16]  David A. Plaisted,et al.  Abstraction Mappings in Mechanical Theorem Proving , 1980, CADE.

[17]  William McCune,et al.  Solution of the Robbins Problem , 1997, Journal of Automated Reasoning.

[18]  Jan M. Zytkow,et al.  Automatic Theorem Generation in Plane Geometry , 1993, ISMIS.

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

[20]  Larry Wos.  Conquering the Meredith Single Axiom , 2004, Journal of Automated Reasoning.

[21]  Stephan Schulz,et al.  E - a brainiac theorem prover , 2002, AI Commun..

[22]  H. Dreyfus.  What Computers Can't Do: The Limits of Artificial Intelligence , 1978 .

[23]  Geoff Sutcliffe,et al.  The TPTP Problem Library , 1994, Journal of Automated Reasoning.

[24]  Allen Newell,et al.  Heuristic Problem Solving: The Next Advance in Operations Research , 1958 .

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

[26]  Andrei Voronkov,et al.  The design and implementation of VAMPIRE , 2002, AI Commun..

[27]  Michael R. Lowry,et al.  Deductive Composition of Astronomical Software from Subroutine Libraries , 1994, CADE.

[28]  Stephan Schulz,et al.  Improving the Performance of Automated Theorem Provers by Redundancy-Free Lemmatization , 2001, FLAIRS.

[29]  Toby Walsh,et al.  On the notion of interestingness in automated mathematical discovery , 2000, Int. J. Hum. Comput. Stud..

[30]  Simon Colton,et al.  Automatic Generation of Benchmark Problems for Automated Theorem Proving Systems , 2002, ISAIM.

[31]  Simon Colton,et al.  Automated Theorem Discovery: A Future Direction for Theorem Provers , 2001 .

[32]  John K. Slaney.  More Proofs of an Axiom of Łukasiewicz , 2004, Journal of Automated Reasoning.