Add to ORKGThis paper presents a generic architecture for proof planning systems in terms of an interaction between a customisable proof module and search module. These refer to both global and local information contained in reasoning states
Based on our experience in developing and employing a rich domain representation for proof planning ...
Proof planning is an alternative methodology to classical automated theorem proving based on exhausi...
Proof planning is a paradigm for the automation of proof that focuses on encoding intelligence to gu...
This paper presents a generic architecture for proof planning systems in terms of an interaction bet...
We present a framework for describing proof planners. This framework is based around a decompositio...
AbstractWe present a framework for describing proof planners. This framework is based around a decom...
Abstract. In this paper we propose how proof planning systems can be extended by an automated learni...
AbstractKnowledge-based proof planning is a new paradigm in automated theorem proving (ATP) which sw...
AbstractA major motivation of proof-planning is to bridge the gap between high-level, cognitively ad...
AbstractProof planning is a technique for theorem proving which replaces the ultra-efficient but bli...
. Mechanised reasoning systems and computer algebra systems have different objectives. Their integra...
Proof planning is an application of AI-planning in mathematical domains. The planning operators, ca...
Centre for Intelligent Systems and their ApplicationsIn this thesis we investigate the applicability...
Humans exhibit a significant ability to answer a wide range of questions about previously unencounte...
Abstract. Proof planning is an approach to the automation of theorem proving in which search is cond...
Based on our experience in developing and employing a rich domain representation for proof planning ...
Proof planning is an alternative methodology to classical automated theorem proving based on exhausi...
Proof planning is a paradigm for the automation of proof that focuses on encoding intelligence to gu...
This paper presents a generic architecture for proof planning systems in terms of an interaction bet...
We present a framework for describing proof planners. This framework is based around a decompositio...
AbstractWe present a framework for describing proof planners. This framework is based around a decom...
Abstract. In this paper we propose how proof planning systems can be extended by an automated learni...
AbstractKnowledge-based proof planning is a new paradigm in automated theorem proving (ATP) which sw...
AbstractA major motivation of proof-planning is to bridge the gap between high-level, cognitively ad...
AbstractProof planning is a technique for theorem proving which replaces the ultra-efficient but bli...
. Mechanised reasoning systems and computer algebra systems have different objectives. Their integra...
Proof planning is an application of AI-planning in mathematical domains. The planning operators, ca...
Centre for Intelligent Systems and their ApplicationsIn this thesis we investigate the applicability...
Humans exhibit a significant ability to answer a wide range of questions about previously unencounte...
Abstract. Proof planning is an approach to the automation of theorem proving in which search is cond...
Based on our experience in developing and employing a rich domain representation for proof planning ...
Proof planning is an alternative methodology to classical automated theorem proving based on exhausi...
Proof planning is a paradigm for the automation of proof that focuses on encoding intelligence to gu...