The Heine–Borel Challenge Problem. In Honor of Woody Bledsoe

Woody Bledsoe’s last challenge problem is the analogical transfer of the Heine–Borel theorem for real intervals to the two-dimensional case. This could not be solved by the up-to-then-known techniques of analogical theorem proving. The Heine–Borel theorem is a widely known result in mathematics. It is usually stated in the field of real numbers R1, and similar versions are also true in R2, in topology, and in metric spaces. This article shows how analogy-driven proof plan construction is applicable to this genuinely mathematical problem. Our goal here was to use a source proof plan of HB1 (the Heine–Borel theorem in R1) as a guide to automatically produce a proof plan of HB2 (the Heine–Borel theorem in R2). We were able to accomplish our goal by generating the target proof plan of HB2 by reformulation and analogical replay.

[1]  W. Bledsoe,et al.  A precondition prover for analogy. , 1995, Bio Systems.

[2]  Xiaorong Huang,et al.  Methods - The Basic Units for Planning and Verifying Proofs , 1999 .

[3]  Manuela Veloso,et al.  Analogy Makes Proofs Feasible , 1999 .

[4]  G. Pólya Mathematics and Plausible Reasoning , 1958 .

[5]  Volker Sorge,et al.  Omega: Towards a Mathematical Assistant , 1997, CADE.

[6]  Michael J. C. Gordon,et al.  Edinburgh LCF: A mechanised logic of computation , 1979 .

[7]  Thomas Kolbe Patching proofs for reuse , 1995 .

[8]  Rob Kling,et al.  A Paradigm for Reasoning by Analogy , 1971, IJCAI.

[9]  Régis Curien Outils pour la preuve par analogie , 1995 .

[10]  Alan Bundy,et al.  The Use of Explicit Plans to Guide Inductive Proofs , 1988, CADE.

[11]  Erica Melis,et al.  Change of Representation in Theorem Proving by Analogy , 1999 .

[12]  Peter Deussen,et al.  Halbgruppen und Automaten , 1971, Heidelberger Taschenbücher.

[13]  J. Hadamard,et al.  The Psychology of Invention in the Mathematical Field. , 1945 .

[14]  Robert S. Boyer,et al.  Computer Proofs of Limit Theorems , 1971, IJCAI.

[15]  C. W. Tate Solve it. , 2005, Nursing standard (Royal College of Nursing (Great Britain) : 1987).

[16]  Jaime G. Carbonell,et al.  Derivational analogy: a theory of reconstructive problem solving and expertise acquisition , 1993 .

[17]  Robert S. Boyer,et al.  Integrating decision procedures into heuristic theorem provers: a case study of linear arithmetic , 1988 .

[18]  Robin Milner,et al.  Edinburgh lcf: a mechanized logic of computation , 1978 .

[19]  James Curie Munyer Analogy as a means of discovery in problem solving and learning , 1981 .

[20]  Erica Melis Analogies between Proofs - A Case Study , 1999 .

[21]  W. W. Bledsoe,et al.  Non-Resolution Theorem Proving , 1977, Artif. Intell..

[22]  Manuela M. Veloso,et al.  Flexible Strategy Learning: Analogical Replay of Problem Solving Episodes , 1994, AAAI.

[23]  Thomas Kolbe,et al.  Patching Proofs for Reuse (Extended Abstract) , 1995, ECML.

[24]  Erica Melis,et al.  A Model of Analogy-Driven Proof-Plan Construction , 1995, IJCAI.

[25]  W. W. Bledsoe,et al.  Challenge problems in elementary calculus , 1990, Journal of Automated Reasoning.

[26]  Bartel Leendert,et al.  Wie der Beweis der Vermutung von Baudet gefunden wurde , 1998 .

[27]  Thomas Kolbe,et al.  Reusing Proofs , 1994, ECAI.

[28]  Stephen Owen,et al.  Analogy for automated reasoning , 1990, Perspectives in artificial intelligence.

[29]  Frank van Harmelen,et al.  Experiments with proof plans for induction , 2004, Journal of Automated Reasoning.

[30]  William McCune,et al.  OTTER 1.0 Users' Guide , 1990 .

[31]  Erica Melis Analogy in CLAM , 1999 .