By Scientia Professor Toby Walsh

Journal articles

Walsh T, 2011, 'Is computational complexity a barrier to manipulation?', Annals of Mathematics and Artificial Intelligence, 62, pp. 7 - 26, http://dx.doi.org/10.1007/s10472-011-9255-9

Yaman F; Walsh TJ; Littman ML; Desjardins M, 2011, 'Democratic approximation of lexicographic preference models', ARTIFICIAL INTELLIGENCE, 175, pp. 1290 - 1307, http://dx.doi.org/10.1016/j.artint.2010.11.012

Pini MS; Rossi F; Venable KB; Walsh T, 2011, 'Incompleteness and incomparability in preference aggregation: Complexity results', Artificial Intelligence, 175, pp. 1272 - 1289, http://dx.doi.org/10.1016/j.artint.2010.11.009

Pini MS; Rossi F; Venable K; Walsh T, 2011, 'Manipulation complexity and gender neutrality in stable marriage procedures', Autonomous Agents and Multi - Agent Systems, 22, pp. 183 - 199, http://dx.doi.org/10.1007/s10458-010-9121-x

Balafoutis ; Paparrizou A; Stergiou K; Walsh T, 2011, 'New algorithms for max restricted path consistency', Constraints, 16, pp. 372 - 406, http://dx.doi.org/10.1007/s10601-011-9110-y

Drescher C; Tifrea O; Walsh T, 2011, 'Symmetry-breaking answer set solving', AI Communications, 24, pp. 177 - 194, http://dx.doi.org/10.3233/AIC-2011-0495

Walsh T, 2011, 'Where are the hard manipulation problems?', Journal of Artificial Intelligence Research, 42, pp. 1 - 29, http://dx.doi.org/10.1613/jair.3223

Drescher C; Walsh T, 2010, 'A translational approach to constraint answer set solving', Theory and Practice of Logic Programming, 10, pp. 465 - 480, http://dx.doi.org/10.1017/S1471068410000220

Gelain M; Pini MS; Rossi F; Venable K; Walsh T, 2010, 'Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies', Artificial Intelligence, 174, pp. 270 - 294, http://dx.doi.org/10.1016/j.artint.2009.11.015

Pini M; Rossi F; Venable K; Walsh T, 2009, 'Aggregating Partially Ordered Preferences', Journal of Logic and Computation, 19, pp. 475 - 502, http://dx.doi.org/10.1093/logcom/exn012

Pini MS; Rossi F; Venable B; Walsh T, 2009, 'Aggregating partially ordered preferences: fairness and startegy proofness', Journal of Logic and Computation, 19, pp. 475 - 502, http://dx.doi.org/10.1093/logcom/exn012

Miguel I; Frisch A; Hnich B; Kiziltan Z; Walsh T, 2009, 'Filtering Algorithms for the MultiSet Ordering Constraint', Artificial Intelligence, 173 (2009), pp. 299 - 328, http://dx.doi.org/10.1016/j.artint.2008.11.001

Bessiere C; Hebrard E; Hnich B; Kiziltan Z; Walsh T, 2009, 'Range and Roots: Two Common patterns for specifying and propagating, counting and occurence constraints', Artificial Intelligence, 173, pp. 1054 - 1078, http://dx.doi.org/10.1016/j.artint.2009.03.001

Bessiere C; Stergiou K; Walsh T, 2008, 'Domain filtering consistencies for non-binary constraints', Artificial Intelligence, 172, pp. 800 - 822, http://dx.doi.org/10.1016/j.artint.2007.10.016

Rossi F; Venable B; Walsh T, 2008, 'Preferences in constraint satisfaction and optimization', AI Magazine, 29, pp. 58 - 68

Walsh T, 2007, 'Representing and reasoning with preferences', AI Magazine, 28, pp. 59 - 69

Walsh TF; Reese GM; Hetmaniuk UL, 2007, 'Explicit a posteriori error estimates for eigenvalue analysis of heterogeneous elastic structures', COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 196, pp. 3614 - 3623, http://dx.doi.org/10.1016/j.cma.2006.10.036

Narodytska N; Walsh T, 2007, 'Constraint and variable-ordering heuristics for compiling configuration problems', , pp. 78 - 81

Bessiere C; Hnich B; Walsh T; Hebrard E, 2007, 'The complexity of reasoning with global constraints', Constraints, 12, pp. 239 - 259, http://dx.doi.org/10.1007/s10601-006-9007-3

Bessiere C; Hebrard E; Hnich B; Kiziltan Z; Walsh T, 2006, 'Filtering algorithms for the NVALUE constraint', Constraints, 11, pp. 271 - 293

Domshlak C; Prestwich S; Rossi F; Venable K; Walsh T, 2006, 'Hard and soft constraints for reasoning about qualitative conditional preferences', Journal of Heuristics, 12, pp. 263 - 285

Frisch A; Hnich B; Kiziltan Z; Miguel I; Walsh T, 2006, 'Propagation algorithms for lexicographic ordering constraints', Artificial Intelligence, 170, pp. 803 - 834

Tarim S; Manandhar S; Walsh T, 2006, 'Stochastic constraint programming: A scenario-based approach', Constraints, 11, pp. 53 - 80

Takenaga Y; Walsh T, 2006, 'TETRAVEX is NP-complete', Information Processing Letters, 99, pp. 171 - 174

Walsh T, 2005, 'Aims and scope', AI Communications, 18, pp. 1

Giunchiglia E; Walsh T, 2005, 'Satisfiability in the Year 2005', Journal of Automated Reasoning, 35, pp. 1 - 2

van Beek P; Walsh T, 2004, 'Principles of Constraint Programming and Constraint Processing: A Review', AI Magazine, 25, pp. 105 - 106, http://dx.doi.org/10.1609/aimag.v25i4.1790

Hnich B; Smith BM; Walsh T, 2004, 'Dual modelling of permutation and injection problems', Journal of Artificial Intelligence Research, 21, pp. 357 - 391, http://dx.doi.org/10.1613/jair.1351

Hnich B; Kiziltan Z; Miguel I; Walsh T, 2004, 'Hybrid modelling for robust solving', Annals of Operations Research, 130, pp. 19 - 39, http://dx.doi.org/10.1023/B:ANOR.0000032568.51115.0d

Bacchus F; Chen X; Van Beek P; Walsh T, 2002, 'Binary vs. non-binary constraints', Artificial Intelligence, 140, pp. 1 - 37, http://dx.doi.org/10.1016/S0004-3702(02)00210-2

Gent IP; Walsh T, 2002, 'Satisfiability in the year 2000', Journal of Automated Reasoning, 28, pp. 99, http://dx.doi.org/10.1023/A:1015051815026

Gent IP; Macintyre E; Prosser P; Smith BM; Walsh T, 2001, 'Random constraint satisfaction: Flaws and structure', Constraints, 6, pp. 345 - 372, http://dx.doi.org/10.1023/A:1011454308633

Gent I; Stergiou K; Walsh T, 2000, 'Decomposable constraints', Artificial Intelligence, 123, pp. 133 - 156, http://dx.doi.org/10.1016/S0004-3702(00)00051-5

Colton S; Bundy A; Walsh T, 2000, 'On the notion of interestingness in automated mathematical discovery', International Journal of Human Computer Studies, 53, pp. 351 - 375, http://dx.doi.org/10.1006/ijhc.2000.0394

Gent IP; Walsh T, 2000, 'Satisfiability in the year 2000', Journal of Automated Reasoning, 24, pp. 1 - 3, http://dx.doi.org/10.1023/a:1006338702529

Gent IP; Walsh T, 1999, 'Paul R. Cohen's Empirical Methods for Artificial Intelligence', Artificial Intelligence, 113, pp. 285 - 290, http://dx.doi.org/10.1016/s0004-3702(99)00056-9

Frank J; Gent IP; Walsh T, 1998, 'Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study', Information Processing Letters, 65, pp. 241 - 245, http://dx.doi.org/10.1016/s0020-0190(97)00222-6

Gent IP; Walsh T, 1998, 'Analysis of heuristics for number partitioning', Computational Intelligence, 14, pp. 430 - 451, http://dx.doi.org/10.1111/0824-7935.00069

Giunchiglia F; Villafiorita A; Walsh T, 1997, 'Theories of abstraction', AI Communications, 10, pp. 167 - 176, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000072878000003&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a

Bundy A; Giunchiglia F; Villafiorita A; Walsh T, 1997, 'Abstract Proof Checking: An Example Motivated by an Incompleteness Theorem', Journal of Automated Reasoning, 19, pp. 319 - 346, http://dx.doi.org/10.1023/A:1005877613942

Basin DA; Walsh T, 1996, 'A calculus for and termination of rippling', Journal of Automated Reasoning, 16, pp. 147 - 180, http://dx.doi.org/10.1007/BF00244462

Walsh T, 1996, 'A divergence critic for inductive proof', Journal of Artificial Intelligence Research, 4, pp. 209 - 235, http://dx.doi.org/10.1613/jair.275

Bundy A; Giunchiglia F; Sebastiani R; Walsh T, 1996, 'Calculating criticalities', Artificial Intelligence, 88, pp. 39 - 67, http://dx.doi.org/10.1016/s0004-3702(96)00019-7

Gent IP; Walsh T, 1996, 'The satisfiability constraint gap', Artificial Intelligence, 81, pp. 59 - 80, http://dx.doi.org/10.1016/0004-3702(95)00047-x

Gent IP; Walsh T, 1996, 'The TSP phase transition', Artificial Intelligence, 88, pp. 349 - 358, http://dx.doi.org/10.1016/s0004-3702(96)00030-6

Gent IP; Walsh T, 1994, 'Easy problems are sometimes hard', Artificial Intelligence, 70, pp. 335 - 345, http://dx.doi.org/10.1016/0004-3702(94)90109-0

Giunchiglia F; Walsh T, 1993, 'The inevitability of inconsistent abstract spaces', Journal of Automated Reasoning, 11, pp. 23 - 41, http://dx.doi.org/10.1007/BF00881899

Walsh T, 1993, 'ECAI’92: A methodological malaise?', AI Communications, 6, pp. 59 - 61, http://dx.doi.org/10.3233/AIC-1993-6105

Gent IP; Walsh T, 1993, 'Empirical analysis of search in GSAT', Journal of Artificial Intelligence Research, 1, pp. 47 - 59, http://dx.doi.org/10.1613/jair.7

Giunchiglia F; Walsh T, 1992, 'A theory of abstraction', Artificial Intelligence, 57, pp. 323 - 389, http://dx.doi.org/10.1016/0004-3702(92)90021-O

Back to profile page