论文信息 - On the Comparison of Proof Planning Systems: lambdaCLAM, Omega and IsaPlanner

On the Comparison of Proof Planning Systems: lambdaCLAM, Omega and IsaPlanner

We present a framework for describing proof planners. This framework is based around a decomposition of proof planners into planning states, proof language, proof plans, proof methods, proof revision, proof control and planning algorithms. We use this framework to motivate the comparison of three recent proof planning systems, @lCLaM, @Wmega and IsaPlanner, and demonstrate how the framework allows us to discuss and illustrate both their similarities and differences in a consistent fashion. This analysis reveals that proof control and the use of contextual information in planning states are key areas in need of further investigation.

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

[2] Antonis C. Kakas,et al. Computational Logic: Logic Programming and Beyond: Essays in Honour of Robert A. Kowalski, Part I , 2002 .

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

[4] Volker Sorge,et al. Proof Development with OMEGA , 2002, CADE.

[5] Lawrence Charles Paulson,et al. Isabelle: A Generic Theorem Prover , 1994 .

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

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

[8] Volker Sorge,et al. Comparing Approaches to the Exploration of the Domain of Residue Classes , 2002, J. Symb. Comput..

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

[10] Alan Bundy,et al. The Automation of Proof by Mathematical Induction , 1999, Handbook of Automated Reasoning.

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

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