Analogy Makes Proofs Feasible

Many mathematical proofs are hard to generate forhumans and even harder for automated theoremprovers. Classical techniques of automated theoremproving involve the application of basic rules, of built-in special procedures, or of tactics. Melis (Melis 1993)introduced a new method for analogical reasoning inautomated theorem proving. In this paper we showhow the derivational analogy replay method is relatedand extended to encompass analogy-driven proof planconstruction. The method is evaluated by showing theproof plan generation of the Pumping Lemma for con-text free languages derived by analogy with the proofplan of the Pumping Lemma for regular languages.This is an impressive evaluation test for the analogicalreasoning method applied to automated theorem prov-ing, as the automated proof of this Pumping Lemmais beyond the capabilities of any of the current auto-mated theorem provers.

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

[2]  Robert S. Boyer,et al.  A computational logic handbook , 1979, Perspectives in computing.

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

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

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

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

[7]  Manuela Veloso Learning by analogical reasoning in general problem-solving , 1992 .

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

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

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

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[12]  Larry Wos,et al.  Automated reasoning - 33 basic research problems , 1988 .

[13]  Mehdi T. Harandi,et al.  Synthesis of UNIX Programs Using Derivational Analogy , 2004, Machine Learning.

[14]  Christos H. Papadimitriou,et al.  Elements of the Theory of Computation , 1997, SIGA.

[15]  Erica Melis How Mathematicians Prove Theorems , 2019, Proceedings of the Sixteenth Annual Conference of the Cognitive Science Society.

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

[17]  Kristian J. Hammond,et al.  Case-based planning: an integrated theory of planning, learning and memory , 1986 .