(2001). An earlier version is available as Research Memo
(2006). An integrated approach to high integrity software veriﬁcation.
(2002). Automated Theory Formation in Pure Mathematics.
(2004). Automatic generation of classification theorems for finite algebras”.
(2004). Automatic generationof classiﬁcation theorems for ﬁnite algebras”.
(2005). Constructing induction rules for deductive synthesis proofs.
Discovery and reasoning in mathematics. In
(1991). Experiments with proof plans for induction.
(1989). Explanation-Based Learning of Proof Plans.
(1999). HR: Automatic concept formation in pure mathematics.
(2001). OANTS – an open approach at combining interactive and automated theorem proving. In M. Kerber 11Lots of other groups have accumulated similar evidence, but surveying that is beyond the scope of the current paper
(2006). On repairing reasoning reversals via representational reﬁnements.
(1996). Productive use of failure in inductive proof.
(1996). Productiveuse of failurein inductiveproof.
(2005). Proof planning for ﬁrst-order temporal logic.
(2001). Proof planning for strategy development.
(2005). Rippling: Meta-level Guidance for Mathematical Reasoning,
(1979). Solving mechanics problems using meta-level inference.
(2001). The automation of proof by mathematical induction.
(2004). The Dynamic Creation of Induction Rules Using Proof Planning.
(2005). The TM system for repairing non-theorems.
(2004). The use of data-mining for the automatic formation of tactics.
(2004). The use of data-mining for the automaticformationof tactics.
The use of explicit plans to guide inductive proofs.
The Use of Planning Critics in Mechanizing Inductive Proofs.
(1981). Using meta-level inference for selective application of multiple rewrite rules in algebraic manipulation.