Abstract. In this paper we propose how proof planning systems can be extended by an automated learning capability. The idea is that a proof planner would be capable of learning new proof methods from well chosen examples of proofs which use a similar reasoning strategy to prove related theorems, and this strategy could be characterised as a proof method. We propose a representation framework for methods, and a machine learning technique which can learn methods using this representation framework. The technique can be applied (amongst other) to learn whether and when to call external systems such as theorem provers or computer algebra systems. This is work in progress, and we hope to gain useful feedback from the CALCULEMUS community.
We present an overview of various learning techniques used in automated theorem provers. We characte...
In this article we formally describe a declarative approach for encoding plan operatorsin proof plan...
This paper presents a generic architecture for proof planning systems in terms of an interaction bet...
In this paper we present a framework for automated learning within mathematical reasoning systems. I...
In this paper we generalize the notion of method for proofplanning. While we adopt the general struc...
AbstractKnowledge-based proof planning is a new paradigm in automated theorem proving (ATP) which sw...
Automated theorem proving based on proof planning is a new and promising paradigm in the field of au...
. Mechanised reasoning systems and computer algebra systems have different objectives. Their integra...
. The paper addresses comprehensible proof presentation for teaching and learning that can be provid...
AbstractWe describebarnacle: a co-operative interface to theclaminductive theorem proving system. Fo...
AbstractProof planning is a technique for theorem proving which replaces the ultra-efficient but bli...
The reasoning power of human-oriented plan-based reasoning systems is primarilyderived from their do...
The reasoning power of human-oriented plan-based reasoning systems is primarily derived from their d...
Proof planning is a powerful technique for theorem proving. Proof plans are descriptions of common p...
Extending the plan-based paradigm for automated theorem proving, we developed in previous work a dec...
We present an overview of various learning techniques used in automated theorem provers. We characte...
In this article we formally describe a declarative approach for encoding plan operatorsin proof plan...
This paper presents a generic architecture for proof planning systems in terms of an interaction bet...
In this paper we present a framework for automated learning within mathematical reasoning systems. I...
In this paper we generalize the notion of method for proofplanning. While we adopt the general struc...
AbstractKnowledge-based proof planning is a new paradigm in automated theorem proving (ATP) which sw...
Automated theorem proving based on proof planning is a new and promising paradigm in the field of au...
. Mechanised reasoning systems and computer algebra systems have different objectives. Their integra...
. The paper addresses comprehensible proof presentation for teaching and learning that can be provid...
AbstractWe describebarnacle: a co-operative interface to theclaminductive theorem proving system. Fo...
AbstractProof planning is a technique for theorem proving which replaces the ultra-efficient but bli...
The reasoning power of human-oriented plan-based reasoning systems is primarilyderived from their do...
The reasoning power of human-oriented plan-based reasoning systems is primarily derived from their d...
Proof planning is a powerful technique for theorem proving. Proof plans are descriptions of common p...
Extending the plan-based paradigm for automated theorem proving, we developed in previous work a dec...
We present an overview of various learning techniques used in automated theorem provers. We characte...
In this article we formally describe a declarative approach for encoding plan operatorsin proof plan...
This paper presents a generic architecture for proof planning systems in terms of an interaction bet...