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, OMEGA 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
Centre for Intelligent Systems and their ApplicationsIn this thesis we investigate the applicability...
In order to cope with large case studies arising from the application of formal methods in an indust...
Proof planning is a paradigm for the automation of proof that focuses on encoding intelligence to gu...
AbstractWe present a framework for describing proof planners. This framework is based around a decom...
This paper presents a generic architecture for proof planning systems in terms of an interaction bet...
Abstract. Proof planning is an approach to the automation of theorem proving in which search is cond...
AbstractKnowledge-based proof planning is a new paradigm in automated theorem proving (ATP) which sw...
Proof planning is an alternative methodology to classical automated theorem proving based on exhausi...
Abstract. In this paper we propose how proof planning systems can be extended by an automated learni...
Proof planning is an alternative methodology to classical automated theorem prov-ing based on exhaus...
Proof Planning Proof planning considers mathematical theorems as planning problems. A proof planning...
AbstractProof planning is a technique for theorem proving which replaces the ultra-efficient but bli...
This paper reports the use of proof planning to diagnose errors in program code. In particular it l...
Based on our experience in developing and employing a rich domain representation for proof planning ...
Centre for Intelligent Systems and their Applicationsaward number 99303126This thesis presents an in...
Centre for Intelligent Systems and their ApplicationsIn this thesis we investigate the applicability...
In order to cope with large case studies arising from the application of formal methods in an indust...
Proof planning is a paradigm for the automation of proof that focuses on encoding intelligence to gu...
AbstractWe present a framework for describing proof planners. This framework is based around a decom...
This paper presents a generic architecture for proof planning systems in terms of an interaction bet...
Abstract. Proof planning is an approach to the automation of theorem proving in which search is cond...
AbstractKnowledge-based proof planning is a new paradigm in automated theorem proving (ATP) which sw...
Proof planning is an alternative methodology to classical automated theorem proving based on exhausi...
Abstract. In this paper we propose how proof planning systems can be extended by an automated learni...
Proof planning is an alternative methodology to classical automated theorem prov-ing based on exhaus...
Proof Planning Proof planning considers mathematical theorems as planning problems. A proof planning...
AbstractProof planning is a technique for theorem proving which replaces the ultra-efficient but bli...
This paper reports the use of proof planning to diagnose errors in program code. In particular it l...
Based on our experience in developing and employing a rich domain representation for proof planning ...
Centre for Intelligent Systems and their Applicationsaward number 99303126This thesis presents an in...
Centre for Intelligent Systems and their ApplicationsIn this thesis we investigate the applicability...
In order to cope with large case studies arising from the application of formal methods in an indust...
Proof planning is a paradigm for the automation of proof that focuses on encoding intelligence to gu...