++++++++++++++++ DOCTORAL PROGRAM ++++++++++++++++++++++++++++++ TUESDAY, September 30 2:00-3:15 Stream B Harpoon Suite: Panel -- How to get industry interested in your PhD thesis 5:00-6:15 Stream B Harpoon Suite: 6 Doctoral Talks distN: An Euclidean Distance Global Constraint, Michael Heusch Explanation for Global Constraints, Guillaume Rochard Computing Explanations for Global Scheduling Constraints, Petr Vilim Useful Explanations, Barry O'Callaghan Sensitivity Analisys in CSPs, Diarmuid Glynn Solution Stability in Constraint Satisfaction Problems, Emmanuel Hebrard 9:00- Doctoral dinner WEDNESDAY, October 1 11:45-13:00 Stream B Harpoon Suite: Doctoral Tutorial -- How to write a PhD thesis, Toby Walsh THURSDAY, October 2 Stream B Harpoon Suite: 2:15-3:15 Doctoral Tutorial -- How to get a PhD in Informatics, Alan Bundy 3:30-4:45 Kinsale Suite: Doctoral poster previews (3 mins each) Identifying inconsistent CSPs by relaxation, Tomas Norlander FeReRA: A Multi-agent Approach to Constraint Satisfaction, Muhammed Basharu Distributed Constraint-Based Railway Simulation, Hans Schlenker On the Enhancement of the Informed Backtracking algorithm, Boutheina Jlifi Introducing ESRA, a relational language for modelling combinatorial problems, Magnus Agren A Framework for comparing Symmetry Breaking Methods, Karen Petrie Efficient Vicktrey-Pricing for Grid Service Providers with Constraints, Alan Holland Abstracting Constraints using Constraints, James Gibbons Self configuring Constraint Programming System, Tom Carchrae Teacher and learner profiles for constraint acquisition, Sarah O'Connel Using Case-Based reasoning to write constraint programs, Cormac Gebruers Watching clauses in quantified boolean formulae, Andrew Rowley Dynamic Step Size Adjustment in Iterative Deepening Search, Daniel Sheridan An adaptive controller for real-time resolution of the vehicle routing problem, Ann Tighe Using Constraint Programming and Simulation for execution monitoring and on-line rescheduling with uncertainty, Julien Bidot A New Approach to Solving SAT-encoded Binary CSPs, Carlos Ansotegui Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT, Jordi Planes Interactivity in Constraint Programming Tomas Muller Search Programming, Wojciech Legierski Search for mathematical objects, Colin Quirke Extending CLP with metaheuristics, Ole Boysen 5:00-6:15 6 Doctoral Talks Observation of Constraint Programs, Ludovic Langevine Open Solver: A Coordination-Enabled Abstract Branch-and-Prune Tree Search Engine, Peter Zoeteweij Restart Strategies: Analysis and Simulation, Huayue Wu Learning good variable orderings, Paula Sturdy Symmetry Breaking Systems, Ian Mac Donald Symmetry Breaking ordering constraints, Zeynep Kiziltan 6:15-7:30 Stream B Harpoon Suite: Doctoral poster session Poster will be on display. An author will be present at each poster display, to discuss the material. FRIDAY, October 3 2:15-3:15 Stream B Harpoon Suite: Doctoral Tutorial -- How to perform experiments, Ian Gent Stream B Harpoon Suite: 3:30-4:45 6 Doctoral Talks Reformulation techniques for a class of permutation problems, Toni Mancini Splitting the atom: A new approach to Neighborhood Interchangeability in CSPs, Chavalit Likitvivatanavong A local filtering algorithm based on semantic decomposition of numerical CSP, H. Batnini Simple Temporal Problems with Preferences and Uncertainty, Brent Venable Optimizing the representation and evaluation of semiring combination constraints Jerome Kelleher Preference constraint: new global soft constraint dedicated to preference binary relations, Remi-Robert Joseph