Abstract
“Mathematics is not a careful march down a well-cleared highway, but a journey into a strange wilderness, where the explorers often get lost. Rigour should be a signal to the historian that the maps have been made, and the real explorers have gone elsewhere.” W.S. Anglin, the Mathematical Intelligencer, 4 (4), 1982.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
How can it be that long ago?
- 2.
I was lucky also to have one of Alan’s postdocs, Fausto Giunchiglia as a second supervisor. We would work together closely for the next decade.
References
Walsh, T.: A Theory of Abstraction. PhD thesis, University of Edinburgh (1991)
Giunchiglia, F., Walsh, T.: A Theory of Abstraction. Artificial Intelligence 56(2–3) (1992) 323–390 Also available as DAI Research Paper No 516, Dept. of Artificial Intelligence, Edinburgh.
Giunchiglia, F., Villafiorita, A., Walsh, T.: Theories of abstraction. AI Communications 10(3,4) (1997) 167–176
Rossi, F., van Beek, P., Walsh, T., eds.: Handbook of Constraint Programming. Foundations of Artificial Intelligence. Elsevier (2006)
Biere, A., Heule, M., van Maaren, H., Walsh, T., eds.: Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications. IOS Press (2009)
Bundy, A., Van Harmelen, F., Hesketh, J., Smaill, A., Stevens, A.: A rational reconstruction and extension of recursion analysis. In: Proceedings of the 11th International Joint Conference on Artificial Intelligence. IJCAI’89, San Francisco, CA, USA, Morgan Kaufmann Publishers Inc. (1989) 359–365
Boyer, R., Moore, J.: A Computational Logic. Academic Press (1979) ACM monograph series.
Hutter, D.: Guiding inductive proofs. In Stickel, M., ed.: 10th International Conference on Automated Deduction, Springer-Verlag (1990) 147–161 Lecture Notes in Artificial Intelligence No. 449.
Bundy, A., van Harmelen, F., Smaill, A., Ireland, A.: Extensions to the rippling-out tactic for guiding inductive proofs. In Stickel, M., ed.: 10th International Conference on Automated Deduction, Springer-Verlag (1990) 132–146 Lecture Notes in Artificial Intelligence No. 449. Also available from Edinburgh as DAI Research Paper 459.
Bundy, A., Stevens, A., van Harmelen, F., Ireland, A., 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.
Basin, D., Walsh, T.: A calculus for rippling. In: Proceedings of CTRS-94. (1994)
Basin, D., Walsh, T.: A calculus for and termination of rippling. Journal of Automated Reasoning 16(1–2) (1996) 147–180
Basin, D., Walsh, T.: Termination orderings for rippling. In Bundy, A., ed.: 12th Conference on Automated Deduction, Springer Verlag (1994) 466–483 Lecture Notes in Artificial Intelligence No. 814.
Basin, D., Walsh, T.: Difference matching. In Kapur, D., ed.: 11th Conference on Automated Deduction, Springer Verlag (1992) 295–309 Lecture Notes in Computer Science No. 607. Also available from Edinburgh as DAI Research Paper 556.
Basin, D., Walsh, T.: Difference unification. In: Proceedings of the 13th IJCAI, International Joint Conference on Artificial Intelligence (1993)
Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Proceedings of the 14th IJCAI, International Joint Conference on Artificial Intelligence (1995) 607–613
Robinson, J.: Notes on resolution. In Bauer, F., ed.: Logic, Algebra, and Computation. Springer Verlag (1989) 109–151
Bundy, A.: The use of explicit plans to guide inductive proofs. In Lusk, E.L., Overbeek, R.A., eds.: 9th International Conference on Automated Deduction. Volume 310 of Lecture Notes in Computer Science., Springer (1988) 111–120
Sterling, L., Bundy, A., Byrd, L., O’Keefe, R.A., Silver, B.: Solving symbolic equations with PRESS. J. Symb. Comput. 7(1) (1989) 71–84
Walsh, T., Nunes, A., Bundy, A.: The use of proof plans to sum series. In Kapur, D., ed.: 11th International Conference on Automated Deduction. Volume 607 of Lecture Notes in Computer Science., Springer (1992) 325–339
Yoshida, T., Bundy, A., Green, I., Walsh, T., Basin, D.A.: Coloured rippling: An extension of a theorem proving heuristic. In Cohn, A.G., ed.: Proceedings of the Eleventh European Conference on Artificial Intelligence, John Wiley and Sons, Chichester (1994) 85–89
Walsh, T.: A divergence critic. In Bundy, A., ed.: 12th Conference on Automated Deduction, Springer Verlag (1994) 14–25 Lecture Notes in Artificial Intelligence No. 814.
Walsh, T.: A divergence critic for inductive proof. Journal of Artificial Intelligence Research 4 (1996) 209–235
Ireland, A., Bundy, A.: Extensions to a generalization critic for inductive proof. In McRobbie, M.A., Slaney, J.K., eds.: 13th International Conference on Automated Deduction. Volume 1104 of Lecture Notes in Computer Science., Springer (1996) 47–61
Ireland, A.: Productive use of failure in inductive proof. J. Autom. Reasoning 16(1-2) (1996) 79–111
Lenat, D.B., Brown, J.S.: Why AM and Eurisko appear to work. In Genesereth, M.R., ed.: Proceedings of the National Conference on Artificial Intelligence (AAAI83), AAAI Press (1983) 236–240
Lenat, D.B., Brown, J.S.: Why AM and EURISKO appear to work. Artif. Intell. 23(3) (1984) 269–294
Colton, S., Bundy, A., Walsh, T.: Automatic identification of mathematical concepts. In: Proceedings of 16th IJCAI, International Joint Conference on Artificial Intelligence (1999)
Colton, S., Bundy, A., Walsh, T.: Automatic invention of integer sequences. In: Proceedings of the 16th National Conference on AI, Association for Advancement of Artificial Intelligence (2000) 558–563
Colton, S., Bundy, A., Walsh, T.: Automatic identification of mathematical concepts. In: Proceedings of the 17th International Conference on Machine Learning. (2000)
Colton, S., Bundy, A., Walsh, T.: On the notion of interestingness in automated mathematical discovery. International Journal of Human-Computer Studies 53(3) (2000) 351–375
Bundy, A., Du Boulay, B., Howe, J., Plotkin, G.: The researchers’ bible. Department of Artificial Intelligence, University of Edinburgh (1985)
Lin, Y., Bundy, A., Grov, G., Maclean, E.: Automating Event-B invariant proofs by rippling and proof patching. Formal Asp. Comput. 31(1) (2019) 95–129
Acknowledgements
Funded by the European Research Council under the Horizon 2020 Programme via the Advanced Research grant AMPLify 670077.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Walsh, T. (2021). Adventures in Mathematical Reasoning. In: Michaelson, G. (eds) Mathematical Reasoning: The History and Impact of the DReaM Group. Springer, Cham. https://doi.org/10.1007/978-3-030-77879-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-77879-8_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-77878-1
Online ISBN: 978-3-030-77879-8
eBook Packages: Computer ScienceComputer Science (R0)