By Scientia Professor Toby Walsh

Conference Papers

Walsh T, 2001, 'Stochastic Constraint Programming', in Aaai Fall Symposium Technical Report, pp. 129 - 135

Colton S; Bundy A; Walsh T, 2000, 'Automatic Invention of Integer Sequences', in Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence Aaai 2000, pp. 558 - 563

Gent I; Stergiou K; Walsh T, 2000, 'Decomposable constraints', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 134 - 149, http://dx.doi.org/10.1007/3-540-44654-0_7

Walsh T, 2000, 'Reformulating propositional satisfiability as constraint satisfaction', in Lecture Notes in Artificial Intelligence Subseries of Lecture Notes in Computer Science, pp. 233 - 246, http://dx.doi.org/10.1007/3-540-44914-0_14

Walsh T, 2000, 'SAT v CSP', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 441 - 456, http://dx.doi.org/10.1007/3-540-45349-0_32

Prosser P; Stergiou K; Walsh T, 2000, 'Singleton consistencies', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 353 - 368, http://dx.doi.org/10.1007/3-540-45349-0_26

Smith B; Stergiou K; Walsh T, 2000, 'Using auxiliary variables and implied constraints to model non-binary problems', in Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence Aaai 2000, pp. 182 - 187

Colton S; Bundy A; Walsh T, 1999, 'Automatic concept formation in pure mathematics', in Ijcai International Joint Conference on Artificial Intelligence, pp. 786 - 791

Walsh T, 1999, 'Search in a small world', in Ijcai International Joint Conference on Artificial Intelligence, pp. 1172 - 1177

Stergiou K; Walsh T, 1999, 'The difference all-difference makes', in Ijcai International Joint Conference on Artificial Intelligence, pp. 414 - 419

Gent IP; Walsh T, 1999, 'Beyond NP: the QSAT phase transition', in Proceedings of the National Conference on Artificial Intelligence, pp. 648 - 653

Gent IP; Walsh T, 1999, 'CSPLIB: A benchmark library for constraints', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 480 - 481, http://dx.doi.org/10.1007/978-3-540-48085-3_36

Stergiou K; Walsh T, 1999, 'Encodings of non-binary constraint satisfaction problems', in Proceedings of the National Conference on Artificial Intelligence, pp. 163 - 168

Gent IP; Hoos HH; Prosser P; Walsh T, 1999, 'Morphing: combining structure and randomness', in Proceedings of the National Conference on Artificial Intelligence, pp. 654 - 660

Meseguer P; Walsh T, 1998, 'Interleaved and discrepancy based search', in Prade H (ed.), ECAI 1998: 13TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, JOHN WILEY & SONS LTD, ENGLAND, BRIGHTON, pp. 239 - 243, presented at 13TH European Conference on Artificial Intelligence (ECAI 98), ENGLAND, BRIGHTON, 23 August 1998 - 28 August 1998, https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000085168300056&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Walsh T, 1998, 'Constrainedness knife-edge', in Proceedings of the National Conference on Artificial Intelligence, pp. 406 - 411

Macintyre E; Prosser P; Smith B; Walsh T, 1998, 'Random constraint satisfaction: Theory meets practice', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 325 - 339, http://dx.doi.org/10.1007/3-540-49481-2_24

Walsh T, 1997, 'Depth-bounded discrepancy search', in Ijcai International Joint Conference on Artificial Intelligence, pp. 1388 - 1393

Gent IP; Walsh T, 1997, 'From approximate t o optimal solutions: Constructing pruning and propagation rules', in Ijcai International Joint Conference on Artificial Intelligence, pp. 1396 - 1401

Gent IP; MacIntyre E; Prosser P; Walsh T, 1997, 'Scaling of search cost', in Proceedings of the National Conference on Artificial Intelligence, pp. 315 - 320

Gent IP; MacIntyre E; Prosser P; Shaw P; Walsh T, 1997, 'The constrainedness of arc consistency', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 327 - 340, http://dx.doi.org/10.1007/bfb0017449

Bundy A; Giunchiglia F; Sebastiani R; Walsh T, 1996, 'Computing abstraction hierarchies by numerical simulation', in Proceedings of the National Conference on Artificial Intelligence, pp. 523 - 529

Gent IP; MacIntyre E; Prosser P; Walsh T, 1996, 'Constrainedness of search', in Proceedings of the National Conference on Artificial Intelligence, pp. 246 - 252

Giunchiglia F; Sebastiani R; Villafiorita A; Walsh T, 1996, 'A general purpose reasoner for abstraction', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 323 - 335, http://dx.doi.org/10.1007/3-540-61291-2_62

Gent IP; MacIntyre E; Prosser P; Smith BM; Walsh T, 1996, 'An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 179 - 193, http://dx.doi.org/10.1007/3-540-61551-2_74

Clark DA; Frank J; Gent IP; MacIntyre E; Tomov N; Walsh T, 1996, 'Local search and the number of solutions', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 119 - 133, http://dx.doi.org/10.1007/3-540-61551-2_70

Basin DA; Walsh T, 1995, 'A calculus for rippling', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 15 - 30, http://dx.doi.org/10.1007/3-540-60381-6_2

Gent IP; Macintyre E; Prosser P; Walsh T, 1995, 'Scaling effects in the csp phase transition', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 70 - 87, http://dx.doi.org/10.1007/3-540-60299-2_5

GENT IP; WALSH T, 1995, 'Unsatisfied variables in local search', in Hallam J (ed.), HYBRID PROBLEMS, HYBRID SOLUTIONS, I O S PRESS, ENGLAND, SHEFFIELD, pp. 73 - 85, presented at 10th Biennial Conference on Artificial Intelligence and the Simulation of Behaviour (AISB95), ENGLAND, SHEFFIELD, https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:A1995BD65P00007&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Walsh T, 1994, 'A divergence critic', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 14 - 28, http://dx.doi.org/10.1007/3-540-58156-1_2

Basin DA; Walsh T, 1994, 'Termination orderings for rippling', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 466 - 483, http://dx.doi.org/10.1007/3-540-58156-1_34

Gent IP; Walsh T, 1994, 'The hardest random SAT problems', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 356 - 366, http://dx.doi.org/10.1007/3-540-58467-6_31

Gent IP; Walsh T, 1993, 'Towards an understanding of hill-climbing procedures for SAT', in Proceedings of the National Conference on Artificial Intelligence, pp. 28 - 33

BASIN DA; WALSH T, 1993, 'DIFFERENCE UNIFICATION', in Bajcsy R (ed.), IJCAI-93, VOLS 1 AND 2, MORGAN KAUFMANN PUB INC, FRANCE, CHAMBERY, pp. 116 - 122, presented at 13th International Joint Conference on Artificial Intelligence (IJCAI-93), FRANCE, CHAMBERY, 28 August 1993 - 03 September 1993, https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:A1993BA18B00017&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Walsh T, 1993, 'General purpose proof plans', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 379 - 383, http://dx.doi.org/10.1007/bfb0013194

WALSH T; NUNES A; BUNDY A, 1992, 'THE USE OF PROOF PLANS TO SUM SERIES', in Kapur D (ed.), AUTOMATED DEDUCTION - CADE-11, SPRINGER-VERLAG BERLIN, NY, SARATOGA SPRINGS, pp. 325 - 339, presented at 11TH INTERNATIONAL CONF ON AUTOMATED DEDUCTION, NY, SARATOGA SPRINGS, 15 June 1992 - 18 June 1992, https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:A1992BX77G00025&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Basin D; Walsh T, 1992, 'Difference matching', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 295 - 309, http://dx.doi.org/10.1007/3-540-55602-8_173

Giunchiglia F; Walsh T, 1990, 'Use of abstraction in automatic inference', in IEE Conference Publication, pp. 365 - 370

Mayer-Eichberger V; Walsh T, 'SAT Encodings for the Car Sequencing Problem', in EPiC Series in Computing, EasyChair, pp. 15 - 1, presented at POS-13. Pragmatics of SAT 2013, http://dx.doi.org/10.29007/jrsp

Conference Abstracts

Vidler A; Walsh T, 2025, 'Shifting Power: Leveraging LLMs to Simulate Human Aversion in ABMs of Bilateral Financial Exchanges, A bond market study: Extended Abstract', in Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems Aamas, pp. 2777 - 2779

Reports

Aziz H; Gaspers S; Sun Z; Walsh T, 2020, From Matching with Diversity Constraints to Matching with Regional Quotas.

Aziz H; Gaspers S; Mattei N; Narodytska N; Walsh T, 2014, Strategic aspects of the probabilistic serial rule for the allocation of goods, https://arxiv.org/abs/1401.6523v1

Gaspers S; Kalinowski T; Narodytska N; Walsh T, 2013, Coalitional Manipulation for Schulze’s Rule

Recorded / Rendered Creative Works

Page J; Walsh T; Hulbert AP, 2017, No Problem Too Big #1 - Artificial Intelligence and Killer Robots, The Conversation, Online and as part of Speaking With podcast, Editor(s): Hulbert A, Podcast, Published: 26 May 2017, Duration: 0:45:10, Recorded / Rendered Creative Works, https://newsroom.unsw.edu.au/news/science-tech/no-problem-too-big-1-artificial-intelligence-and-killer-robots

Working Papers

Aziz H; Chan H; Lee BE; Li B; Walsh T, 2020, Facility location problem with capacity constraints: Algorithmic and mechanism design perspectives, Association for the Advancement of Artificial Intelligence (AAAI), http://dx.doi.org10.1609/aaai.v34i02.5547

Aziz H; Gaspers S; Mackenzie S; Mattei N; Stursberg P; Walsh T, 2014, Fixing a balanced knockout tournament, http://dx.doi.org

Preprints

Olckers M; Walsh T, 2026, Incentives to Offer Algorithmic Recourse, http://dx.doi.org/10.48550/arxiv.2301.12884

Katkalo D; Rohovyi A; Walsh T, 2026, Adapting Dijkstra for Buffers and Unlimited Transfers, http://dx.doi.org/10.48550/arxiv.2603.11729

Rohovyi A; Abuaisha A; Walsh T, 2026, Early Pruning for Public Transport Routing, http://dx.doi.org/10.48550/arxiv.2603.12592

Katkalo D; Rohovyi A; Walsh T, 2026, Fast and Memory Efficient Multimodal Journey Planning with Delays, http://dx.doi.org/10.48550/arxiv.2604.16149

Back to profile page