1. Aubin, R.: Some generalization heuristics in proofs by induction, in G. Huet and G. Kahn (eds), Actes du Colloque Construction: Amélioration et vérification de Programmes, Institut de recherche d'informatique et d'automatique, 1975.
2. Boyer, R. S. and Moore, J. S.: A Computational Logic, Academic Press, New York, 1979. ACM monograph series.
3. Bouhoula, A. and Rusinowitch, M.: Automatic case analysis in proof by induction, in Proc. 13th IJCAI, Int. Joint Conf. Artificial Intelligence, 1993.
4. Bundy, A., Stevens, A., vanHarmelen, F., Ireland, A., and Smaill, A.: Rippling: A heuristic for guiding inductive proofs, Artificial Intelligence 62 (1993), 185–253. Also available from Edinburgh as DAI Research Paper No. 567.
5. Bundy, A.: The use of explicit plans to guide inductive proofs, in R. Lusk and R. Overbeek (eds), 9th Conf. Automated Deduction, Springer-Verlag, 1988, pp. 111–120. Longer version avilable from Edinburgh as DAI Research Paper No. 349.