This paper describes a declarative approach forencoding the plan operators in proof planning,the so-called methods. The notion of methodevolves from the much studied concept of a tac-tic and was first used by A. Bundy. Signific-ant deductive power has been achieved withthe planning approach towards automated de-duction; however, the procedural character ofthe tactic part of methods hinders mechanicalmodification. Although the strength of a proofplanning system largely depends on powerfulgeneral procedures which solve a large class ofproblems, mechanical or even automated modi-fication of methods is necessary, since methodsdesigned for a specific type of problems willnever be general enough. After introducing thegeneral framework, we exempli...
AbstractInformal mathematical reasoning has a strong metamathematical component, which is used to ex...
. Mechanised reasoning systems and computer algebra systems have different objectives. Their integra...
peer reviewedIn practice, mathematical proofs are most often the result of careful planning by the a...
In this paper we generalize the notion of method for proofplanning. While we adopt the general struc...
The reasoning power of human-oriented plan-based reasoning systems is primarily derived from their d...
The reasoning power of human-oriented plan-based reasoning systems is primarilyderived from their do...
In this article we formally describe a declarative approach for encoding plan operatorsin proof plan...
This paper concerns a knowledge structure called method , within a compu-tational model for human or...
Extending the plan-based paradigm for automated theorem proving, we developed in previous work a dec...
Abstract. In this paper we propose how proof planning systems can be extended by an automated learni...
AbstractProof planning is a technique for theorem proving which replaces the ultra-efficient but bli...
This thesis presents an investigation into the structure of proof in non-standard analysis using pro...
A lot of the human ability to prove hard mathematical theorems can be ascribedto a problem-specific ...
Proof planning is a powerful technique for theorem proving. Proof plans are descriptions of common p...
AbstractWe describebarnacle: a co-operative interface to theclaminductive theorem proving system. Fo...
AbstractInformal mathematical reasoning has a strong metamathematical component, which is used to ex...
. Mechanised reasoning systems and computer algebra systems have different objectives. Their integra...
peer reviewedIn practice, mathematical proofs are most often the result of careful planning by the a...
In this paper we generalize the notion of method for proofplanning. While we adopt the general struc...
The reasoning power of human-oriented plan-based reasoning systems is primarily derived from their d...
The reasoning power of human-oriented plan-based reasoning systems is primarilyderived from their do...
In this article we formally describe a declarative approach for encoding plan operatorsin proof plan...
This paper concerns a knowledge structure called method , within a compu-tational model for human or...
Extending the plan-based paradigm for automated theorem proving, we developed in previous work a dec...
Abstract. In this paper we propose how proof planning systems can be extended by an automated learni...
AbstractProof planning is a technique for theorem proving which replaces the ultra-efficient but bli...
This thesis presents an investigation into the structure of proof in non-standard analysis using pro...
A lot of the human ability to prove hard mathematical theorems can be ascribedto a problem-specific ...
Proof planning is a powerful technique for theorem proving. Proof plans are descriptions of common p...
AbstractWe describebarnacle: a co-operative interface to theclaminductive theorem proving system. Fo...
AbstractInformal mathematical reasoning has a strong metamathematical component, which is used to ex...
. Mechanised reasoning systems and computer algebra systems have different objectives. Their integra...
peer reviewedIn practice, mathematical proofs are most often the result of careful planning by the a...