Proof planning with multiple strategies

Proof planning is a technique for theorem proving which replaces the ultra-efficient but blind search of classical theorem proving systems by an informed knowledge-based planning process that employs mathematical knowledge at a human-oriented level of abstraction. Standard proof planning uses methods as operators and control rules to find an abstract proof plan which can be expanded (using tactics) down to the level of the underlying logic calculus. In this paper, we propose more flexible refinements and a modification of the proof planner with an additional strategic level of control above the previous proof planning control. This strategic control guides the cooperation of the problem solving strategies by meta-reasoning. We present a general framework for proof planning with multiple strategies and describe its implementation in the Multi system. The benefits are illustrated by several large case studies, which significantly push the limits of what can be achieved by a machine today.

[1]  H. P Nii,et al.  Blackboard Systems , 1986 .

[2]  Volker Sorge,et al.  Agent based mathematical reasoning , 1999, Calculemus.

[3]  Robert Gardner,et al.  Introduction To Real Analysis , 1994 .

[4]  Victor R. Lesser,et al.  Unifying Data-Directed and Goal-Directed Control: An Example and Experiments , 1982, AAAI.

[5]  Ian Green,et al.  System description : Proof planning in higher-order logic with λ Clam , 1998 .

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

[7]  Stephen Fickas,et al.  The Design and an Example Use of Hearsay-III , 1981, IJCAI.

[8]  Thomas Hillenbrand,et al.  System Description: Waldmeister - Improvements in Performance and Ease of Use , 1999, CADE.

[9]  Anders Læsø Madsen,et al.  Proceedings of the 13th European Conference on Artificial Intelligence , 1998 .

[10]  Jacques D. Fleuriot,et al.  IsaPlanner: A Prototype Proof Planner in Isabelle , 2003, CADE.

[11]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[12]  Adele E. Howe,et al.  Exploiting Competitive Planner Performance , 1999, ECP.

[13]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[14]  Andreas Meier.  System Description: TRAMP: Transformation of Machine-Found Proofs into ND-Proofs at the Assertion Level , 2000, CADE.

[15]  Simon Colton,et al.  Employing Theory Formation to Guide Proof Planning , 2002, AISC.

[16]  Woody Bledsoe.  I had a dream: AAAI presidential address , 1986 .

[17]  Barbara Hayes-Roth,et al.  A Blackboard Architecture for Control , 1985, Artif. Intell..

[18]  Serge Autexier,et al.  The MathServe System for Semantic Web Reasoning Services , 2006, IJCAR.

[19]  Gerhard Weiss,et al.  Multiagent systems: a modern approach to distributed artificial intelligence , 1999 .

[20]  Erica Melis,et al.  Constraint Solving for Proof Planning , 2004, Journal of Automated Reasoning.

[21]  Arjeh M. Cohen,et al.  Certifying Solutions to Permutation Group Problems , 2003, CADE.

[22]  Hantao Zhang,et al.  SEM: a System for Enumerating Models , 1995, IJCAI.

[23]  Christoph Weidenbach.  SPASS - Version 0.49 , 2004, Journal of Automated Reasoning.

[24]  Erica Melis,et al.  Knowledge-Based Proof Planning , 1999, Artif. Intell..

[25]  Jörg H. Siekmann,et al.  Computer supported mathematics with Omegamega , 2006, J. Appl. Log..

[26]  Erica Melis,et al.  System Description: Multi A Multi-strategy Proof Planner , 2005, CADE.

[27]  Johann Schumann.  SiCoTHEO - Simple competitive parallel theorem provers based on SETHEO , 1997, Parallel Processing for Artificial Intelligence 3.

[28]  Erica Melis,et al.  Proof planning with multiple strategies , 2000, Artif. Intell..

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

[30]  Alan Robinson,et al.  Handbook of automated reasoning , 2001 .

[31]  Jörg H. Siekmann,et al.  Proof Development with Ωmega: The Irrationality of \(\sqrt 2\) , 2003 .

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

[33]  Frank van Harmelen,et al.  Rippling: A Heuristic for Guiding Inductive Proofs , 1993, Artif. Intell..

[34]  Alan H. Schoenfeld,et al.  Mathematical Problem Solving , 1985 .

[35]  Simon Colton,et al.  Automated Theory Formation in Pure Mathematics , 2002, Distinguished dissertations.

[36]  Erica Melis.  The "Limit" Domain , 1998, AIPS.

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

[38]  Alan Bundy.  A Critique of Proof Planning , 2002, Computational Logic: Logic Programming and Beyond.

[39]  Erica Melis,et al.  AI-Techniques in Proof Planning , 1998, ECAI.

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

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

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

[43]  Erica Melis,et al.  Flexibly Interleaving Processes , 1999, ICCBR.

[44]  Erica Melis,et al.  Adaptable Mixed-Initiative Proof Planning for Educational Interaction , 2004, Electron. Notes Theor. Comput. Sci..

[45]  Eugene Fink,et al.  Integrating planning and learning: the PRODIGY architecture , 1995, J. Exp. Theor. Artif. Intell..

[46]  Edmund H. Durfee,et al.  Incremental Planning to Control a Blackboard-based Problem Solver , 1986, AAAI.

[47]  Serge Autexier,et al.  Hierarchical contextual reasoning , 2003 .

[48]  Daniel S. Weld.  An Introduction to Least Commitment Planning , 1994, AI Mag..

[49]  Erica Melis,et al.  Impasse-Driven Reasoning in Proof Planning , 2005, MKM.

[50]  Jörg Denzinger,et al.  Cooperation of Heterogeneous Provers , 1999, IJCAI.

[51]  Andrew Ireland,et al.  Productive use of failure in inductive proof , 1996, Journal of Automated Reasoning.

[52]  David E. Wilkins,et al.  A Call for Knowledge-Based Planning , 2001, AI Mag..

[53]  Eugene Fink,et al.  How to Solve It Automatically: Selection Among Problem Solving Methods , 1998, AIPS.

[54]  Andreas Wolf.  Strategy Selection for Automated Theorem Proving , 1998, AIMSA.

[55]  Andrew Ireland,et al.  The Use of Planning Critics in Mechanizing Inductive Proofs , 1992, LPAR.

[56]  David E. Wilkins,et al.  A Multiagent Planning Architecture , 1998, AIPS.

[57]  Ian Green,et al.  System Description: Proof Planning in Higher-Order Logic with Lambda-Clam , 1998, CADE.