Doctoral Programme is a forum held during the CP conference which provides an opportunity for a group of Ph.D. students to achieve visibility and discuss their research interests and career objectives with each other and established researchers in Constraint Programming. After successful Doctoral Programmes in previous years, it is being run again this year for the fifth time.

The aims of the Doctoral Programme are the following:

• to provide a forum for Ph.D. students to present their current research, and receive feedback from other students and senior researchers;
• to promote contacts among Ph.D. students and senior researchers working in the same area;
• to exchange research experience;
• to support Ph.D. students with information and advice on academic, research and industrial careers;
• and to financially support its participants

The programme consist of presentations and posters of the students who do not have any paper/poster accepted at the main technical programme, and tutorials given by senior researchers in the field. In addition, each student is matched to a mentor who is a senior researcher with similar research interests and who can advise the student on his/her research progress. Finally, a doctoral dinner is organised to bring together the students in an informal gathering.

Hotel

The hotel is very close to the train station. Take the Francesc Gum? street (just in front of the train station) and go until the end. Then you find the Jesus street. The hotel is on that street, on the right.

Programme

Tutorials:
• Sunday October 2, 10:45 - 11.45: How to write a good paper, Toby Walsh, NICTA and University of News South Wales (Australia)
• Monday October 3, 14:45 - 15:45: Publishing Papers and the Publication Process, Andy King, University of Kent (UK)

Mentors: Each student is matched to a mentor. Students not presenting their work in the main technical programme are linked to their research abstracts.
• Yaling Zheng => David Cohen
• Cyril Canon => Chris Beck
• Jerome Fortin => Chris Beck
• Jordi Planes => Steve Prestwich
• Federico Heras => Simon de Givry
• Le Chang => Thomas Schiex
• Josep Argelich => Ian Gent
• Magnus Ågren => Gilles Pesant
• Pavel Surynek => Ian Miguel
• Horst Samulowitz => Kostas Stergiou
• Luis Quesada => Christian Schulte
• Emma Rollon=> Rina Dechter
• David Burke => Amnon Meisels
• Josef Zlomek => Javier Larrosa
• Tiziana Ligorio => Barbara Smith
• Hui Li => John Hooker
• Emmanuel Hebrard => Peter van Beek
• Henry Müller => Helmut Simonis
• Hadrien Cambazard => Pascal van Hentenryck
• Gregoire Dooms => Nicolas Beldiceanu
• Roie Zivan => Katsutoshi Hirayama
• Ismel Brito => Boi Faltings
• Marti Sanchez => Gerard Verfaille
• Tudor Hulubei => Carla Gomes
• Latife Genc Kaya => Mats Carlsson
• Deepak Mehta => Christian Bessiere
• Mihaela Butaru => Jean-Francois Puget
• Alfio Vidotto => Pedro Barahona
• Ivan Dotu => Laurent Perron
• Quang-Huy Nguyen => Andrea Roli
• Andrei Legtchenko => Eric Monfroy
• Christine Wei Wu => Roman Bartak
• Chris Unsworth => Brahim Hnich
• Carlos Grandon => Francesca Rossi
• Stéphane Zampelli => Roland Yap
• Stefania Verachi => Pascal van Hentenryck
• Peter Nightingale => Fahiem Bacchus
• Pavel Cejnar => David Mitchell
• Carles Mateu => Ken Brown
• Montserrat Abril => Amnon Meisels
• Claude-Guy Quimper => Meinolf Sellmann
• Matthias Hoche => Alan Frisch
• Eric Hsu => Francesca Rossi
• Chris Houghton => Toby Walsh
• Tom Carchrae => Hector Geffner
• Cheuk Fun Bede => Jean-Charles Regin
• Roland Martin => Warwick Harvey
• Lucian Leahu => Michel Rueher
• Bernadette Martinez-Hernandez => Barbara Smith
• Radu Marinescu => Neil Yorke-Smith

Presentations: Presentations will take place on Saturday October 1, Sunday October 2, and Monday October 3 in room LEVANT 5. Each student has 15 minutes in total, including the time for questions. Students are kindly asked to upload their presentation to the conference laptop so as to save time between presentations.

Saturday Oct. 1

Session chair: Hadrien Cambazard
17:00 - 17:15 Solving Over-Constrained Problems with SAT, Josep Argelich
17:15 - 17:30 Using Constraint Programming for Solving Distance CSP with uncertainty, Carlos Grandon
17:30 - 17:45 Encoding HTN Planning as a Dynamic CSP, Pavel Surynek
17:45 - 18:00 Statistical modelling of CSP solving algorithms performance, Carles Mateu
18:00 - 18:15 Robust constraint solving using multiple heuristics, Alfio Vidotto
18:15 - 18:30 Improved algorithm for finding (a,b)-super solutions, Emmanuel Hebrard

Sunday Oct. 2

Session chair: Zeynep Kiziltan
10:30 - 11:20 Tutorial: How to write a good paper, Toby Walsh, NICTA and University of News South Wales (Australia)

11:20- 11:25 Short Break

Session chair: Magnus Agren
11:25 - 11:40 Applying Decomposition Methods to Crossword Puzzle Problems, Yaling Zheng
11:40 - 11:55 Partial Redundant Modeling, Tiziana Ligorio
11:55 - 12:10 Towards the Systematic Generation of Channelling Constraints, Bernadette Martinez-Hernandez
12:10 - 12:25 Domain Reduction for the Circuit Constraint, Latife Genc Kaya
12:25 - 12:40 From Linear Relaxations to Global Constraint Propagation, Claude-Guy Quimper

12:40 - 14:05 Conference Opening Reception
14:05 - 15:30 Conference Tutorials
15:30 - 16:00 Coffee Break

Session chair: Roland Martin
16:00 - 16:15 LP as a Global Search Heuristic Across Different Constrainedness Regions, Lucian Leahu
16:15 - 16:30 Sheduling Social Tournaments , Ivan Dotu
16:30 - 16:45 Scheduling with uncertain release dates, Christine Wei Wu
16:45 - 17:00 Methods to Learn Abstract Scheduling Models, Tom Carchrae
17:00 - 17:15 Distributed Constraints for Large-Scale Scheduling Problems, Montserrat Abril
17:15 - 17:30 Probabilistic Arc Consistency, Deepak Mehta
17:30 - 17:45 Consistency for Partially Defined Constraints, Andrei Legtchenko

Monday Oct. 3

Session chair: Enrico Pontelli
14:45 - 15:45 Tutorial: Publishing Papers and the Publication Process, Andy King, University of Kent (UK)

Posters: Poster presentations will take place on Monday October 3 between 16:30 - 17:30 in room Foyer. The maximum size of the posters should be 100 cm (base) x 248 cm (height).

Dimensionning an inbound call center using constraint programming, Cyril Canon
Local Consistency in Weighted CSPs and Inference in Max-SAT, Federico Heras
Constraint-Based Inference: A Bridge between Constraint Processing and Probability Inference, Le Chang
Speeding up constrained path solvers with a reachability propagator, Luis Quesada
A Constraint Based Agent for TAC-SCM, David Burke
Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains, Josef Zlomek
GOOSE -- A generic object-oriented search environment, Henry Müller
Solving the Car-Sequencing Problem as a Non-binary CSP, Mihaela Butaru
Randomization for Multi-agent Constraint Optimization, Quang-Huy Nguyen
Specialised Constraints for Stable Matching Problems, Chris Unsworth
Bounds-Consistent Local Search, Stefania Verachi
Automated Search for Heuristic Functions, Pavel Cejnar
Modeling Constraint Programs with Software Technology Standards, Matthias Hoche
Mechanism Design for Preference Aggregation over Coalitions, Eric Hsu
Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems, Christopher Houghton
Subnet Generation Problem: A New Network Routing Problem, Cheuk Fun Bede Leung
Weak Symmetries in Problem Formulations, Roland Martin
The Role of Redundant Clauses in Solving Satisfiability Problems, Honglei Zeng
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems, Radu Marinescu

Doctoral Dinner: The dinner will take place in the restaurant EL VIVERO on Monday October 3 at 20:30.

Organization

Doctoral Programme Chairs:
Zeynep Kiziltan and Michela Milano

DEIS, Università di Bologna, Italy
Email: cp-phd2005@deis.unibo.it

Organizing Committee:
Roman Bartak, Charles University, Czech Republic
Ian Gent, University of St. Andrews, U.K.
Carla Gomes, Cornell University, U.S.A.
Brahim Hnich, 4C, University College Cork, Ireland
Javier Larrosa, Universitat Politècnica de Catalunya, Spain
Gilles Pesant, École Polytechnique de Montréal, Canada
Meinolf Sellmann, Brown University, U.S.A.
Toby Walsh, University of New South Wales, Australia