1. Bain, M. and Srinivasan, A. (1995). Inductive Logic Programming with Large-Scale Unstructured Data. Machine Intelligence 14, K. Furukawa, D. Michie, and S. Muggleton (eds.), pp. 233267, Oxford University Press.
2. Bain, M. (1994). Learning Logical Exceptions in Chess. Ph.D. Thesis, University of Strathclyde [printed as Thesis 7866, Dept. of Statistics and Modelling Science, University of Strathclyde]. Bain, M. and Muggleton, S. (1994). Learning Optimal Chess Strategies. Machine Intelligence 13
3. K. Furukawa, D. Michie, and S. Muggleton (eds.), pp. 291–309, Oxford University Press. Barth, W. (1995). Combining Knowledge and Search to Yield Infallible Endgame Programs. ICCA Journal, Vol. 18, No. 3, pp. 149–159.
4. Barth, W. and Barth, S. (1992). Validating a Range of Endgame Programs. ICCA Journal, Vol. 15, No. 3, pp. 132–139.
5. Beal, D.F. and Clarke, M.R.B. (1980). The Construction of Economical and Correct Algorithms for King and Pawn against King. Advances in Computer Chess 2, M.R.B. Clarke (ed.), pp. 130, Edinburgh University Press.