Knowledge-based proof planning
Artificial Intelligence
Comparing approaches to the exploration of the domain of residue classes
Journal of Symbolic Computation - Integrated reasoning and algebra systems
The Use of Planning Critics in Mechanizing Inductive Proofs
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
The Use of Explicit Plans to Guide Inductive Proofs
Proceedings of the 9th International Conference on Automated Deduction
System Description: Proof Planning in Higher-Order Logic with Lambda-Clam
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
A tactic language for declarative proofs
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Hi-index | 0.00 |
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.