In this paper we present a framework for automated learning within mathematical reasoning systems. In particular, this framework enables proof planning systems to automatically learn new proof methods from well chosen examples of proofs which use a similar reasoning pattern to prove related theorems. Our framework consists of a representation formalism for methods and a machine learning technique which can learn methods using this representation formalism. We present the implementation of this framework within the mega proof planning system, and some experiments we ran on this implementation to evaluate the validity of our approach
This paper presents a generic architecture for proof planning systems in terms of an interaction bet...
In this article we formally describe a declarative approach for encoding plan operatorsin proof plan...
The e ective use of automated theorem provers is frequently augmented by embedding these systems int...
In this paper we present a framework for automated learning within mathematical reasoning systems. I...
Abstract. In this paper we propose how proof planning systems can be extended by an automated learni...
. The paper addresses comprehensible proof presentation for teaching and learning that can be provid...
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...
AbstractProof planning is a technique for theorem proving which replaces the ultra-efficient but bli...
Extending the plan-based paradigm for automated theorem proving, we developed in previous work a dec...
When mathematicians present proofs they usually adapt their explanations to their didactic goals an...
AbstractWe describebarnacle: a co-operative interface to theclaminductive theorem proving system. Fo...
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...
This paper presents a generic architecture for proof planning systems in terms of an interaction bet...
In this article we formally describe a declarative approach for encoding plan operatorsin proof plan...
The e ective use of automated theorem provers is frequently augmented by embedding these systems int...
In this paper we present a framework for automated learning within mathematical reasoning systems. I...
Abstract. In this paper we propose how proof planning systems can be extended by an automated learni...
. The paper addresses comprehensible proof presentation for teaching and learning that can be provid...
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...
AbstractProof planning is a technique for theorem proving which replaces the ultra-efficient but bli...
Extending the plan-based paradigm for automated theorem proving, we developed in previous work a dec...
When mathematicians present proofs they usually adapt their explanations to their didactic goals an...
AbstractWe describebarnacle: a co-operative interface to theclaminductive theorem proving system. Fo...
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...
This paper presents a generic architecture for proof planning systems in terms of an interaction bet...
In this article we formally describe a declarative approach for encoding plan operatorsin proof plan...
The e ective use of automated theorem provers is frequently augmented by embedding these systems int...