| 2009 |
|---|
| 173 | EE | Alan M. Frisch,
Brahim Hnich,
Zeynep Kiziltan,
Ian Miguel,
Toby Walsh:
Filtering algorithms for the multiset ordering constraint.
Artif. Intell. 173(2): 299-328 (2009) |
| 172 | EE | Christian Bessiere,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints
CoRR abs/0903.0211: (2009) |
| 171 | EE | Alan M. Frisch,
Brahim Hnich,
Zeynep Kiziltan,
Ian Miguel,
Toby Walsh:
Filtering Algorithms for the Multiset Ordering Constraint
CoRR abs/0903.0460: (2009) |
| 170 | EE | Toby Walsh:
Breaking Value Symmetry
CoRR abs/0903.0465: (2009) |
| 169 | EE | Christian Bessiere,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
The Parameterized Complexity of Global Constraints
CoRR abs/0903.0467: (2009) |
| 168 | EE | Claude-Guy Quimper,
Toby Walsh:
Decompositions of Grammar Constraints
CoRR abs/0903.0470: (2009) |
| 167 | EE | Christian Bessiere,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
SLIDE: A Useful Special Case of the CARDPATH Constraint
CoRR abs/0903.0471: (2009) |
| 166 | EE | George Katsirelos,
Nina Narodytska,
Toby Walsh:
Reformulating Global Grammar Constraints
CoRR abs/0903.0475: (2009) |
| 165 | EE | George Katsirelos,
Nina Narodytska,
Toby Walsh:
Combining Symmetry Breaking and Global Constraints
CoRR abs/0903.0479: (2009) |
| 164 | EE | Shai Haim,
Toby Walsh:
Online Estimation of SAT Solving Runtime
CoRR abs/0903.0695: (2009) |
| 163 | EE | Toby Walsh:
Symmetry Breaking Using Value Precedence
CoRR abs/0903.1136: (2009) |
| 162 | EE | Toby Walsh:
Complexity of Terminating Preference Elicitation
CoRR abs/0903.1137: (2009) |
| 161 | EE | Christian Bessiere,
Emmanuel Hebrard,
Brahim Hnich,
Toby Walsh:
The Complexity of Reasoning with Global Constraints
CoRR abs/0903.1139: (2009) |
| 160 | EE | Toby Walsh:
Breaking Value Symmetry
CoRR abs/0903.1146: (2009) |
| 159 | EE | Yasuhiko Takenaga,
Toby Walsh:
Tetravex is NP-complete
CoRR abs/0903.1147: (2009) |
| 158 | EE | Armagan Tarim,
Suresh Manandhar,
Toby Walsh:
Stochastic Constraint Programming: A Scenario-Based Approach
CoRR abs/0903.1150: (2009) |
| 157 | EE | Toby Walsh:
Stochastic Constraint Programming
CoRR abs/0903.1152: (2009) |
| 2008 |
|---|
| 156 | | Claude-Guy Quimper,
Toby Walsh:
Decompositions of Grammar Constraints.
AAAI 2008: 1567-1570 |
| 155 | | Toby Walsh:
Breaking Value Symmetry.
AAAI 2008: 1585-1588 |
| 154 | | Christian Bessiere,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Claude-Guy Quimper,
Toby Walsh:
The Parameterized Complexity of Global Constraints.
AAAI 2008: 235-240 |
| 153 | EE | Toby Walsh:
Complexity of terminating preference elicitation.
AAMAS (2) 2008: 967-974 |
| 152 | EE | Michael J. Maher,
Nina Narodytska,
Claude-Guy Quimper,
Toby Walsh:
Flow-Based Propagators for the SEQUENCE and Related Global Constraints.
CP 2008: 159-174 |
| 151 | EE | Mirco Gelain,
Maria Silvia Pini,
Francesca Rossi,
Kristen Brent Venable,
Toby Walsh:
Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies.
CP 2008: 402-417 |
| 150 | EE | George Katsirelos,
Nina Narodytska,
Toby Walsh:
The Weighted CfgConstraint.
CPAIOR 2008: 323-327 |
| 149 | EE | Christian Bessiere,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
SLIDE: A Useful Special Case of the CARDPATH Constraint.
ECAI 2008: 475-479 |
| 148 | | Maria Silvia Pini,
Francesca Rossi,
Kristen Brent Venable,
Toby Walsh:
Dealing with Incomplete Agents' Preferences and an Uncertain Agenda in Group Decision Making via Sequential Majority Voting.
KR 2008: 571-578 |
| 147 | EE | Shai Haim,
Toby Walsh:
Online Estimation of SAT Solving Runtime.
SAT 2008: 133-138 |
| 146 | EE | Christian Bessiere,
Kostas Stergiou,
Toby Walsh:
Domain filtering consistencies for non-binary constraints.
Artif. Intell. 172(6-7): 800-822 (2008) |
| 2007 |
|---|
| 145 | | Toby Walsh:
Uncertainty in Preference Elicitation and Aggregation.
AAAI 2007: 3-8 |
| 144 | EE | Sebastian Brand,
Nina Narodytska,
Claude-Guy Quimper,
Peter J. Stuckey,
Toby Walsh:
Encodings of the Sequence Constraint.
CP 2007: 210-224 |
| 143 | EE | George Katsirelos,
Toby Walsh:
A Compression Algorithm for Large Arity Extensional Constraints.
CP 2007: 379-393 |
| 142 | EE | Yat Chiu Law,
Jimmy Ho-Man Lee,
Toby Walsh,
J. Y. K. Yip:
Breaking Symmetry of Interchangeable Variables and Values.
CP 2007: 423-437 |
| 141 | EE | Claude-Guy Quimper,
Toby Walsh:
Decomposing Global Grammar Constraints.
CP 2007: 590-604 |
| 140 | EE | Toby Walsh:
Breaking Value Symmetry.
CP 2007: 880-887 |
| 139 | EE | Emmanuel Hebrard,
Barry O'Sullivan,
Toby Walsh:
Distance Constraints in Constraint Satisfaction.
IJCAI 2007: 106-111 |
| 138 | EE | Jérôme Lang,
Maria Silvia Pini,
Francesca Rossi,
Kristen Brent Venable,
Toby Walsh:
Winner Determination in Sequential Majority Voting.
IJCAI 2007: 1372-1377 |
| 137 | EE | Maria Silvia Pini,
Francesca Rossi,
Kristen Brent Venable,
Toby Walsh:
Incompleteness and Incomparability in Preference Aggregation.
IJCAI 2007: 1464-1469 |
| 136 | EE | Nina Narodytska,
Toby Walsh:
Constraint and Variable Ordering Heuristics for Compiling Configuration Problems.
IJCAI 2007: 149-154 |
| 135 | EE | Christian Bessiere,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Claude-Guy Quimper,
Toby Walsh:
Reformulating Global Constraints: The Slideand RegularConstraints.
SARA 2007: 80-92 |
| 134 | EE | Christian Bessiere,
Emmanuel Hebrard,
Brahim Hnich,
Toby Walsh:
The Complexity of Reasoning with Global Constraints.
Constraints 12(2): 239-259 (2007) |
| 133 | EE | Carsten Sinz,
Albert Haag,
Nina Narodytska,
Toby Walsh,
Esther Gelle,
Mihaela Sabin,
Ulrich Junker,
Barry O'Sullivan,
Rick Rabiser,
Deepak Dhungana,
Paul Grünbacher,
Klaus Lehner,
Christian Federspiel,
Daniel Naus:
Configuration.
IEEE Intelligent Systems 22(1): 78-90 (2007) |
| 2006 |
|---|
| 132 | | Philip Kilby,
John K. Slaney,
Sylvie Thiébaux,
Toby Walsh:
Estimating Search Tree Size.
AAAI 2006 |
| 131 | EE | Maria Silvia Pini,
Francesca Rossi,
Kristen Brent Venable,
Toby Walsh:
Strategic voting when aggregating partially ordered preferences.
AAMAS 2006: 685-687 |
| 130 | EE | Toby Walsh:
Symmetry Breaking.
Australian Conference on Artificial Intelligence 2006: 7-8 |
| 129 | EE | Toby Walsh:
General Symmetry Breaking Constraints.
CP 2006: 650-664 |
| 128 | EE | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
The ROOTS Constraint.
CP 2006: 75-90 |
| 127 | EE | Claude-Guy Quimper,
Toby Walsh:
Global Grammar Constraints.
CP 2006: 751-755 |
| 126 | EE | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
The Range Constraint: Algorithms and Implementation.
CPAIOR 2006: 59-73 |
| 125 | | Kostas Stergiou,
Toby Walsh:
Inverse Consistencies for Non-Binary Constraints.
ECAI 2006: 153-157 |
| 124 | | Toby Walsh:
Symmetry Breaking Using Value Precedence.
ECAI 2006: 168- |
| 123 | | Maria Silvia Pini,
Francesca Rossi,
Kristen Brent Venable,
Toby Walsh:
Computing Possible and Necessary Winners from Incomplete Partially-Ordered Preferences.
ECAI 2006: 767-768 |
| 122 | EE | Alan M. Frisch,
Brahim Hnich,
Zeynep Kiziltan,
Ian Miguel,
Toby Walsh:
Propagation algorithms for lexicographic ordering constraints.
Artif. Intell. 170(10): 803-834 (2006) |
| 121 | EE | Armagan Tarim,
Suresh Manandhar,
Toby Walsh:
Stochastic Constraint Programming: A Scenario-Based Approach.
Constraints 11(1): 53-80 (2006) |
| 120 | EE | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
Filtering Algorithms for the NValueConstraint.
Constraints 11(4): 271-293 (2006) |
| 119 | EE | Yasuhiko Takenaga,
Toby Walsh:
Tetravex is NP-complete.
Inf. Process. Lett. 99(5): 171-174 (2006) |
| 118 | EE | Carmel Domshlak,
Steven David Prestwich,
Francesca Rossi,
Kristen Brent Venable,
Toby Walsh:
Hard and soft constraints for reasoning about qualitative conditional preferences.
J. Heuristics 12(4-5): 263-285 (2006) |
| 2005 |
|---|
| 117 | | Fahiem Bacchus,
Toby Walsh:
Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings
Springer 2005 |
| 116 | | Philip Kilby,
John K. Slaney,
Sylvie Thiébaux,
Toby Walsh:
Backbones and Backdoors in Satisfiability.
AAAI 2005: 1368-1373 |
| 115 | | Emmanuel Hebrard,
Brahim Hnich,
Barry O'Sullivan,
Toby Walsh:
Finding Diverse and Similar Solutions in Constraint Programming.
AAAI 2005: 372-377 |
| 114 | | Steven David Prestwich,
Francesca Rossi,
Kristen Brent Venable,
Toby Walsh:
Constraint-Based Preferential Optimization.
AAAI 2005: 461-466 |
| 113 | EE | Peter J. Stuckey,
Maria J. García de la Banda,
Michael J. Maher,
Kim Marriott,
John K. Slaney,
Zoltan Somogyi,
Mark Wallace,
Toby Walsh:
The G12 Project: Mapping Solver Independent Models to Efficient Solutions.
CP 2005: 13-16 |
| 112 | EE | Claude-Guy Quimper,
Toby Walsh:
Beyond Finite Domains: The All Different and Global Cardinality Constraints.
CP 2005: 812-816 |
| 111 | EE | Emmanuel Hebrard,
Toby Walsh:
Improved Algorithm for Finding (a, b)-Super Solutions.
CP 2005: 848 |
| 110 | EE | Emmanuel Hebrard,
Paul Tyler,
Toby Walsh:
Computing Super-Schedules.
CP 2005: 879-879 |
| 109 | EE | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
Filtering Algorithms for the NValue Constraint.
CPAIOR 2005: 79-93 |
| 108 | EE | Claude-Guy Quimper,
Toby Walsh:
The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables.
CSCLP 2005: 1-13 |
| 107 | EE | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
Among, Common and Disjoint Constraints.
CSCLP 2005: 29-43 |
| 106 | EE | Peter J. Stuckey,
Maria J. García de la Banda,
Michael J. Maher,
Kim Marriott,
John K. Slaney,
Zoltan Somogyi,
Mark Wallace,
Toby Walsh:
The G12 Project: Mapping Solver Independent Models to Efficient Solutions.
ICLP 2005: 9-13 |
| 105 | EE | Philip Kilby,
John K. Slaney,
Toby Walsh:
The Backbone of the Travelling Salesperson.
IJCAI 2005: 175-180 |
| 104 | EE | Fahiem Bacchus,
Toby Walsh:
Propagating Logical Combinations of Constraints.
IJCAI 2005: 35-40 |
| 103 | EE | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
The Range and Roots Constraints: Specifying Counting and Occurrence Problems.
IJCAI 2005: 60-65 |
| 102 | EE | Alan M. Frisch,
Brahim Hnich,
Ian Miguel,
Barbara M. Smith,
Toby Walsh:
Transforming and Refining Abstract Constraint Specifications.
SARA 2005: 76-91 |
| 101 | EE | Maria Silvia Pini,
Francesca Rossi,
Kristen Brent Venable,
Toby Walsh:
Aggregating partially ordered preferences: impossibility and possibility results.
TARK 2005: 193-206 |
| 100 | | Francesca Rossi,
Kristen Brent Venable,
Toby Walsh:
Aggregating preferences cannot be fair.
Intelligenza Artificiale 2(1): 30-38 (2005) |
| 99 | EE | Enrico Giunchiglia,
Toby Walsh:
Satisfiability in the Year 2005.
J. Autom. Reasoning 35(1-3): 1-2 (2005) |
| 2004 |
|---|
| 98 | | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Toby Walsh:
The Complexity of Global Constraints.
AAAI 2004: 112-117 |
| 97 | | Francesca Rossi,
Kristen Brent Venable,
Toby Walsh:
mCP Nets: Representing and Reasoning with Preferences of Multiple Agents.
AAAI 2004: 729-734 |
| 96 | EE | Brahim Hnich,
Zeynep Kiziltan,
Toby Walsh:
Combining Symmetry Breaking with Other Constraints: Lexicographic Ordering with Sums.
AMAI 2004 |
| 95 | EE | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Toby Walsh:
Disjoint, Partition and Intersection Constraints for Set and Multiset Variables.
CP 2004: 138-152 |
| 94 | EE | Christian Thiffault,
Fahiem Bacchus,
Toby Walsh:
Solving Non-clausal Formulas with DPLL Search.
CP 2004: 663-678 |
| 93 | EE | Christian Bessière,
Emmanuel Hebrard,
Brahim Hnich,
Toby Walsh:
The Tractability of Global Constraints.
CP 2004: 716-720 |
| 92 | EE | Emmanuel Hebrard,
Brahim Hnich,
Toby Walsh:
Super Solutions in Constraint Programming.
CPAIOR 2004: 157-172 |
| 91 | | Emmanuel Hebrard,
Brahim Hnich,
Toby Walsh:
Robust Solutions for Constraint Satisfaction and Optimization.
ECAI 2004: 186-190 |
| 90 | EE | Christian Thiffault,
Fahiem Bacchus,
Toby Walsh:
Solving Non-clausal Formulas with DPLL search.
SAT 2004 |
| 89 | | Peter van Beek,
Toby Walsh:
Principles of Constraint Programming and Constraint Processing: A Review.
AI Magazine 25(4): 105-106 (2004) |
| 88 | EE | Brahim Hnich,
Zeynep Kiziltan,
Ian Miguel,
Toby Walsh:
Hybrid Modelling for Robust Solving.
Annals OR 130(1-4): 19-39 (2004) |
| 87 | EE | Brahim Hnich,
Toby Walsh,
Barbara M. Smith:
Dual Modelling of Permutation and Injection Problems.
J. Artif. Intell. Res. (JAIR) 21: 357-391 (2004) |
| 2003 |
|---|
| 86 | | Georg Gottlob,
Toby Walsh:
IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 9-15, 2003
Morgan Kaufmann 2003 |
| 85 | EE | Toby Walsh:
Constraint Patterns.
CP 2003: 53-64 |
| 84 | EE | Toby Walsh:
Consistency and Propagation with Multiset Constraints: A Formal Viewpoint.
CP 2003: 724-738 |
| 83 | | Carmel Domshlak,
Francesca Rossi,
Kristen Brent Venable,
Toby Walsh:
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques.
IJCAI 2003: 215-220 |
| 82 | | Alan M. Frisch,
Ian Miguel,
Zeynep Kiziltan,
Brahim Hnich,
Toby Walsh:
Multiset Ordering Constraints.
IJCAI 2003: 221-226 |
| 81 | | Suresh Manandhar,
Armagan Tarim,
Toby Walsh:
Scenario-based Stochastic Constraint Programming.
IJCAI 2003: 257-262 |
| 80 | EE | Christian Bessière,
Emmanuel Hebrard,
Toby Walsh:
Local Consistencies in SAT.
SAT 2003: 299-314 |
| 2002 |
|---|
| 79 | | Toby Walsh:
The Interface between P and NP: COL, XOR, NAE, 1-in-k, and Horn SAT.
AAAI/IAAI 2002: 695- |
| 78 | EE | Pierre Flener,
Alan M. Frisch,
Brahim Hnich,
Zeynep Kiziltan,
Ian Miguel,
Justin Pearson,
Toby Walsh:
Breaking Row and Column Symmetries in Matrix Models.
CP 2002: 462-476 |
| 77 | EE | Brahim Hnich,
Toby Walsh:
Models of Injection Problems.
CP 2002: 781 |
| 76 | EE | Lyndon Drake,
Alan M. Frisch,
Toby Walsh:
Automatic Generation of Implied Clauses for SAT.
CP 2002: 783 |
| 75 | EE | Alan M. Frisch,
Brahim Hnich,
Zeynep Kiziltan,
Ian Miguel,
Toby Walsh:
Global Constraints for Lexicographic Orderings.
CP 2002: 93-108 |
| 74 | | Toby Walsh:
Stochastic Constraint Programming.
ECAI 2002: 111-115 |
| 73 | EE | Alan M. Frisch,
Daniel Sheridan,
Toby Walsh:
A Fixpoint Based Encoding for Bounded Model Checking.
FMCAD 2002: 238-255 |
| 72 | EE | Alan M. Frisch,
Ian Miguel,
Toby Walsh:
CGRASS: A System for Transforming Constraint Satisfaction Problems.
International Workshop on Constraint Solving and Constraint Logic Programming 2002: 15-30 |
| 71 | | Benjamin Bell,
Lola Cañamero,
Silvia Coradeschi,
Carla P. Gomes,
Alessandro Saffiotti,
Costas Tsatsoulis,
Toby Walsh:
AAAI 2002 Fall Symposium Series Reports.
AI Magazine 23(2): 91-94 (2002) |
| 70 | | M. Brian Blake,
Karen Zita Haigh,
Henry Hexmoor,
Rino Falcone,
Leen-Kiat Soh,
Chitta Baral,
Sheila A. McIlraith,
Piotr J. Gmytrasiewicz,
Simon Parsons,
Rainer Malaka,
Antonio Krüger,
Paolo Bouquet,
Bill Smart,
Koichi Kurumantani,
Adam Pease,
Michael Brenner,
Marie desJardins,
Ulrich Junker,
James P. Delgrande,
Jon Doyle,
Francesca Rossi,
Torsten Schaub,
Carla P. Gomes,
Toby Walsh,
Haipeng Guo,
Eric Horvitz,
Nancy Ide,
Christopher A. Welty,
Frank D. Anger,
Hans W. Guesgen,
Gérard Ligozat:
AAAI 2002 Workshops.
AI Magazine 23(4): 113-121 (2002) |
| 69 | EE | Fahiem Bacchus,
Xinguang Chen,
Peter van Beek,
Toby Walsh:
Binary vs. non-binary constraints.
Artif. Intell. 140(1/2): 1-37 (2002) |
| 68 | | Ian P. Gent,
Toby Walsh:
Satisfiability in the Year 2000.
J. Autom. Reasoning 28(2): 99 (2002) |
| 2001 |
|---|
| 67 | | Toby Walsh:
Principles and Practice of Constraint Programming - CP 2001, 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings
Springer 2001 |
| 66 | | John K. Slaney,
Toby Walsh:
Backbones in Optimization and Approximation.
IJCAI 2001: 254-259 |
| 65 | | Toby Walsh:
Search on High Degree Graphs.
IJCAI 2001: 266-274 |
| 64 | EE | Toby Walsh:
Permutation Problems and Channelling Constraints.
LPAR 2001: 377-391 |
| 63 | | Berthe Y. Choueiry,
Toby Walsh:
Symposium on Abstraction, Reformulation, and Approximation (SARA-2000).
AI Magazine 22(1): 137-138 (2001) |
| 62 | | Ian P. Gent,
Ewan MacIntyre,
Patrick Prosser,
Barbara M. Smith,
Toby Walsh:
Random Constraint Satisfaction: Flaws and Structure.
Constraints 6(4): 345-372 (2001) |
| 2000 |
|---|
| 61 | | Berthe Y. Choueiry,
Toby Walsh:
Abstraction, Reformulation, and Approximation, 4th International Symposium, SARA 2000, Horseshoe Bay, Texas, USA, July 26-29, 2000, Proceedings
Springer 2000 |
| 60 | | Barbara M. Smith,
Kostas Stergiou,
Toby Walsh:
Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems.
AAAI/IAAI 2000: 182-187 |
| 59 | | Simon Colton,
Alan Bundy,
Toby Walsh:
Automatic Invention of Integer Sequences.
AAAI/IAAI 2000: 558-563 |
| 58 | EE | Patrick Prosser,
Kostas Stergiou,
Toby Walsh:
Singleton Consistencies.
CP 2000: 353-368 |
| 57 | EE | Toby Walsh:
SAT v CSP.
CP 2000: 441-456 |
| 56 | | Simon Colton,
Alan Bundy,
Toby Walsh:
Automatic Identification of Mathematical Concepts.
ICML 2000: 183-190 |
| 55 | EE | Toby Walsh:
Reformulating Propositional Satisfiability as Constraint Satisfaction.
SARA 2000: 233-246 |
| 54 | EE | Ian P. Gent,
Kostas Stergiou,
Toby Walsh:
Decomposable constraints.
Artif. Intell. 123(1-2): 133-156 (2000) |
| 53 | EE | Simon Colton,
Alan Bundy,
Toby Walsh:
On the notion of interestingness in automated mathematical discovery.
Int. J. Hum.-Comput. Stud. 53(3): 351-375 (2000) |
| 52 | | Ian P. Gent,
Toby Walsh:
Satisfiability in the Year 2000.
J. Autom. Reasoning 24(1/2): 1-3 (2000) |
| 1999 |
|---|
| 51 | | Kostas Stergiou,
Toby Walsh:
Encodings of Non-Binary Constraint Satisfaction Problems.
AAAI/IAAI 1999: 163-168 |
| 50 | | Ian P. Gent,
Toby Walsh:
Beyond NP: the QSAT phase transition.
AAAI/IAAI 1999: 648-653 |
| 49 | | Ian P. Gent,
Holger H. Hoos,
Patrick Prosser,
Toby Walsh:
Morphing: Combining Structure and Randomness.
AAAI/IAAI 1999: 654-660 |
| 48 | | Ian P. Gent,
Toby Walsh:
CSPLIB: A Benchmark Library for Constraints.
CP 1999: 480-481 |
| 47 | | Toby Walsh:
Search in a Small World.
IJCAI 1999: 1172-1177 |
| 46 | | Kostas Stergiou,
Toby Walsh:
The Difference All-Difference Makes.
IJCAI 1999: 414-419 |
| 45 | | Simon Colton,
Alan Bundy,
Toby Walsh:
Automatic Concept Formation in Pure Mathematics.
IJCAI 1999: 786-793 |
| 44 | EE | Ian P. Gent,
Kostas Stergiou,
Toby Walsh:
Decomposable Constraints.
New Trends in Constraints 1999: 134-149 |
| 43 | EE | Ian P. Gent,
Toby Walsh:
Paul R. Cohen's Empirical Methods for Artificial Intelligence.
Artif. Intell. 113(1-2): 285-290 (1999) |
| 1998 |
|---|
| 42 | | Toby Walsh:
The Constrainedness Knife-Edge.
AAAI/IAAI 1998: 406-411 |
| 41 | EE | Ewan MacIntyre,
Patrick Prosser,
Barbara M. Smith,
Toby Walsh:
Random Constraint Satisfaction: Theory Meets Practice.
CP 1998: 325-339 |
| 40 | | Pedro Meseguer,
Toby Walsh:
Interleaved and Discrepancy Based Search.
ECAI 1998: 239-243 |
| 39 | | Toby Walsh:
Empirical Methods in AI.
AI Magazine 19(2): 121-124 (1998) |
| 38 | EE | Jeremy Frank,
Ian P. Gent,
Toby Walsh:
Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study.
Inf. Process. Lett. 65(5): 241-245 (1998) |
| 1997 |
|---|
| 37 | | Ian P. Gent,
Ewan MacIntyre,
Patrick Prosser,
Toby Walsh:
The Scaling of Search Cost.
AAAI/IAAI 1997: 315-320 |
| 36 | | Ian P. Gent,
Ewan MacIntyre,
Patrick Prosser,
Toby Walsh:
The Constrainedness of Arc Consistency.
CP 1997: 327-340 |
| 35 | | Toby Walsh:
Depth-bounded Discrepancy Search.
IJCAI 1997: 1388-1395 |
| 34 | | Ian P. Gent,
Toby Walsh:
From Approximate to Optimal Solutions: Constructing Pruning and Propagation Rules.
IJCAI 1997: 1396-1401 |
| 33 | | Fausto Giunchiglia,
Adolfo Villafiorita,
Toby Walsh:
Theories of Abstraction.
AI Commun. 10(3-4): 167-176 (1997) |
| 32 | | Alan Bundy,
Fausto Giunchiglia,
Adolfo Villafiorita,
Toby Walsh:
Abstract Proof Checking: An Example Motivated by an Incompleteness Theorem.
J. Autom. Reasoning 19(3): 319-346 (1997) |
| 1996 |
|---|
| 31 | | Ian P. Gent,
Ewan MacIntyre,
Patrick Prosser,
Toby Walsh:
The Constrainedness of Search.
AAAI/IAAI, Vol. 1 1996: 246-252 |
| 30 | | Alan Bundy,
Fausto Giunchiglia,
Roberto Sebastiani,
Toby Walsh:
Computing Abstraction Hierarchies by Numerical Simulation.
AAAI/IAAI, Vol. 1 1996: 523-529 |
| 29 | | David A. Clark,
Jeremy Frank,
Ian P. Gent,
Ewan MacIntyre,
Neven Tomov,
Toby Walsh:
Local Search and the Number of Solutions.
CP 1996: 119-133 |
| 28 | | Ian P. Gent,
Ewan MacIntyre,
Patrick Prosser,
Barbara M. Smith,
Toby Walsh:
An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem.
CP 1996: 179-193 |
| 27 | | Fausto Giunchiglia,
Roberto Sebastiani,
Adolfo Villafiorita,
Toby Walsh:
A General Purpose Reasoner for Abstraction.
Canadian Conference on AI 1996: 323-335 |
| 26 | | Ian P. Gent,
Toby Walsh:
Phase Transitions and Annealed Theories: Number Partitioning as a Case Study.
ECAI 1996: 170-174 |
| 25 | EE | Ian P. Gent,
Toby Walsh:
The Satisfiability Constraint Gap.
Artif. Intell. 81(1-2): 59-80 (1996) |
| 24 | EE | Ian P. Gent,
Toby Walsh:
The TSP Phase Transition.
Artif. Intell. 88(1-2): 349-358 (1996) |
| 23 | EE | Alan Bundy,
Fausto Giunchiglia,
Roberto Sebastiani,
Toby Walsh:
Calculating Criticalities.
Artif. Intell. 88(1-2): 39-67 (1996) |
| 22 | EE | Toby Walsh:
A Divergence Critic for Inductive Proof
CoRR cs.AI/9604101: (1996) |
| 21 | | Toby Walsh:
A Divergence Critic for Inductive Proof.
J. Artif. Intell. Res. (JAIR) 4: 209-235 (1996) |
| 20 | | David A. Basin,
Toby Walsh:
A Calculus for and Termination of Rippling.
J. Autom. Reasoning 16(1-2): 147-180 (1996) |
| 1995 |
|---|
| 19 | | Ian P. Gent,
Ewan MacIntyre,
Patrick Prosser,
Toby Walsh:
Scaling Effects in the CSP Phase Transition.
CP 1995: 70-87 |
| 1994 |
|---|
| 18 | | Toby Walsh:
A Divergence Critic.
CADE 1994: 14-28 |
| 17 | | David A. Basin,
Toby Walsh:
Termination Orderings for Rippling.
CADE 1994: 466-483 |
| 16 | | David A. Basin,
Toby Walsh:
A Calculus for Rippling.
CTRS 1994: 15-30 |
| 15 | | Ian P. Gent,
Toby Walsh:
The SAT Phase Transition.
ECAI 1994: 105-109 |
| 14 | | Tetsuya Yoshida,
Alan Bundy,
Ian Green,
Toby Walsh,
David A. Basin:
Coloured Rippling: An Extension of a Theorem Proving Heuristic.
ECAI 1994: 85-89 |
| 13 | | Ian P. Gent,
Toby Walsh:
The Hardest Random SAT Problems.
KI 1994: 355-366 |
| 12 | | Ian P. Gent,
Toby Walsh:
Easy Problems are Sometimes Hard.
Artif. Intell. 70(1-2): 335-345 (1994) |
| 1993 |
|---|
| 11 | | Ian P. Gent,
Toby Walsh:
Towards an Understanding of Hill-Climbing Procedures for SAT.
AAAI 1993: 28-33 |
| 10 | | Toby Walsh:
General Purpose Proof Plans.
DISCO 1993: 379-383 |
| 9 | | David A. Basin,
Toby Walsh:
Difference Unification.
IJCAI 1993: 116-122 |
| 8 | EE | Ian P. Gent,
Toby Walsh:
An Empirical Analysis of Search in GSAT
CoRR cs.AI/9309101: (1993) |
| 7 | | Ian P. Gent,
Toby Walsh:
An Empirical Analysis of Search in GSAT.
J. Artif. Intell. Res. (JAIR) 1: 47-59 (1993) |
| 6 | | Fausto Giunchiglia,
Toby Walsh:
The Inevitability of Inconsistent Abstract Spaces.
J. Autom. Reasoning 11(1): 23-41 (1993) |
| 1992 |
|---|
| 5 | | David A. Basin,
Toby Walsh:
Difference Matching.
CADE 1992: 295-309 |
| 4 | | Toby Walsh,
Alex Nunes,
Alan Bundy:
The Use of Proof Plans to Sum Series.
CADE 1992: 325-339 |
| 3 | | Fausto Giunchiglia,
Toby Walsh:
Tree Subsumption: Reasoning with Outlines.
ECAI 1992: 77-81 |
| 2 | | Fausto Giunchiglia,
Toby Walsh:
A Theory of Abstraction.
Artif. Intell. 57(2-3): 323-389 (1992) |
| 1989 |
|---|
| 1 | | Fausto Giunchiglia,
Toby Walsh:
Abstract Theorem Proving.
IJCAI 1989: 372-377 |
