Proof Planning: A Fresh Start?
Proof Planning is a technique for automated (and interactive) theorem proving that searches for proof plans at the level of abstract methods. Proof methods consist of a chunk of mathematically motivated, recurring patterns of calculus level inferences with additional preand post-conditions that model their applicability conditions. Despite its partial success, proof planning has various shortcomings. In this paper we discuss some shortcomings of proof planning in the mega system. They result mainly from the strong coupling of the search for a proof plan at the method level with the underlying logic-calculus level. We present some ideas to overcome these shortcomings by separating the plan level and the calculus level completely.