Experiments with proof plans for induction
Journal of Automated Reasoning
Knowledge-based proof planning
Artificial Intelligence
Continuation Semantics for PROLOG with Cut
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
XBarnacle: Making Theorem Provers More Accessible
CADE-14 Proceedings of the 14th 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
Omega: Towards a Mathematical Assistant
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
| Hi-index | 0.00 |
Proof planningis an automated theorem provingtec hnique which encodes meaningful blocks of proof as planning operators called methods. Methods often encode complex control strategies, and a language of methodicals, similar to tacticals, has been developed to allow methods to be expressed in a modular way. Previous work has demonstrated that proof planningcan be effective for interactive theorem proving, but it has not been clear how to reconcile the complex control encoded by methodicals with the needs of interactive theorem proving. In this paper we develop an operational semantics for methodicals which allows reasoningab out proof plans in the abstract, without generating object-level proofs, and facilitates interactive planning. The semantics is defined by a handful of deterministic transition rules, represents disjunction and backtrackingin the planningpro cess explicitly, and handles the cut methodical correctly.