1. Tutorial given at ICLP-86, Seattle;M. Bruynooghe,1986
2. Bundy, A., Smaill, A. and Hesketh, J. (1990). Turning eureka steps into calculations in automatic program synthesis. In Clarke, S.L.H., (ed.), Proceedings of UK IT 90, pages 221–6. Also available from Edinburgh as DAI Research Paper 448.
3. Bundy, A., Stevens, A., van Harmelen, F., Ireland, A. and Smaill, A. (1991). Rippling: A heuristic for guiding inductive proofs. Research Paper 567, Dept. of Artificial Intelligence, Edinburgh, To appear in Artificial Intelligence.
4. De Schreye, K. D. and Verschaetse. (1992). Termination of logic programs: Tutorial notes. Technical Report CW-report 148, Department of Computer Science, Katholieke Universiteit Leuven, Belgium, To appear in the proceedings of Meta-92.
5. Deville, Y. (1990). Logic programming: systematic program development. Addison-Wesley Pub. Co.