Planning and Patching Proof - Artificial Intelligence and Symbolic Computation - page 37

[Smaill & Green, 1996] Smaill, Alan and Green, Ian. (1996). Higher-order annotated
terms for proof search. In von Wright, Joakim, Grundy, Jim and Harrison, John,
(eds.), Theorem Proving in Higher Order Logics: 9th International Conference,
TPHOLs'96 , volume 1275 of Lecture Notes in Computer Science , pages 399-414,
Turku, Finland. Springer-Verlag. Also available as DAI Research Paper 799.
[Stark & Ireland, 1998] Stark, J. and Ireland, A. (1998). Invariant discovery via failed
proof attempts. In Flener, P., (ed.), Logic-based Program Synthesis and Transfor-
mation , number 1559 in LNCS, pages 271-288. Springer-Verlag.
[Sterling et al , 1989] Sterling, L., Bundy, Alan, Byrd, L., O'Keefe, R. and Silver, B.
(1989). Solving symbolic equations with PRESS. J. Symbolic Computation , 7:71-
84. Also available from Edinburgh as DAI Research Paper 171.
[Willmott et al , 2001] Willmott, S., Richardson, J. D. C., Bundy, A. and Levine, J. M.
(2001). Applying adversarial planning techniques to Go. Journal of Theoretical
Computer Science , 252(1-2):45-82. Special issue on algorithms, Automata, com-
plexity and Games.