Structured Incremental Proof Planning

We extend our framework of incremental proof planning. By employing nested sets of meta-rules the formulation of strategies may be structured. By switching to another meta-rule set the planner can adjust to a new situation within the proof. The new meta-rule set represents a more specialized strategy better suited for the current situation. We define the semantics of our framework by an inference system.

[1]  Xiaorong Huang,et al.  Planning Mathematical Proofs with Methods , 1994, J. Inf. Process. Cybern..

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

[3]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[4]  Martin Protzen,et al.  Lazy Generation of Induction Hypotheses , 1994, CADE.

[5]  Alan Bundy,et al.  A Science of Reasoning , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[6]  Jörg Denzinger,et al.  Extending automatic theorem proving by planning , 1993 .

[7]  Stefan Gerberding,et al.  Incremental Proof Planning by Meta-Rules , 1997 .

[8]  Stefan Gerberding,et al.  Choosing induction relations within the INKA-system , 1995 .