Structured Incremental Proof Planning

  title={Structured Incremental Proof Planning},
  author={Stefan Gerberding and Brigitte Pientka},
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. 
An approach to assertion application via generalized resolution
A distributed mediator module is proposed between a mathematical knowledge base and a theorem proving system which is independent of the particular proof representation format of (*) and which applies generalised resolution in order to analyze the logical consequences of arbitrary assertions for a proof context at hand.
Research Statement Higher-order Logic Programming
This work applies techniques from logic, type theory, and automated deduction to find rigorous solutions to problems exposed in practice in the logical framework Twelf, which provides an experimental platform to specify, implement, and execute formal systems.


Incremental Proof Planning by Meta-Rules
We propose a new approach to automated tactical theorem proving and proof planning: By using metarules to control the search for a proof, heuristic knowledge is declaratively collected. This eases
Extending automatic theorem proving by planning
A general concept for combining planning with automatic theorem provingis introduced. From this a system architecture based on the notion of planningtrees, methods and sensors is developed. It is
Planning Mathematical Proofs with Methods
A declarative approach for encoding plan operators in proof planning, the so-called methods is formally described and the tacticpart of a method is split into aDeclarative and a procedural part in order to enable a tractableadaption of methods.
A Science of Reasoning
  • A. Bundy
  • Philosophy, Computer Science
    Computational Logic - Essays in Honor of Alan Robinson
  • 1991
A role for computation is proposed to provide this high-level understanding of proofs, namely by the association of proof plans with proofs.
Lazy Generation of Induction Hypotheses
Analysis of successful induction proofs reveals that these proofs can be guided without reference to a specific induction axiom, which means that required induction hypotheses can be computed during the proof.
Computational Logic
This paper presents a meta-modelling simulation of the response of the immune system to changes in the environment through the course of natural selection.
Strukturierung der Beweisplanung durch Metaregelmengen
  • Strukturierung der Beweisplanung durch Metaregelmengen
  • 1997
Inkrementelle Beweisplanung mit Metaregeln
  • Inkrementelle Beweisplanung mit Metaregeln
  • 1996