Workshops and Doctoral Program
Achieving High Quality Knowledge Acquisition using Controlled Natural Language Tiantian Gao (25min) Constraint Programming for Multi-criteria Conceptual Clustering Maxime Chabert (5min) Improved Filtering for the Bin-Packing with Cardinality Constraint Guillaume Derval (5min) Extending Compact-Table to Basic Smart Tables Hélène Verhaeghe (5min) CoverSize: A Global Constraint for Frequency-based Itemset Mining John Aoga (5min) Weight-Aware Core Extraction in SAT-Based MaxSAT Solving Jeremias Berg (5min)
|10:00-10:30||Coffee, tea, refreshments|
|10:30-11:00||Workshops and Doctoral Program
Branch-and-Check with Explanations for the Vehicle Routing Problem with Time Windows Edward Lam (5min) SAT-Encodings for Special Treewidth and Pathwidth Neha Lodha (5min) Introducing Pareto Minimal Correction Subsets Miguel Terra-Neves (5min) Learning the Parameters of Global Constraints Using Branch-and-Bound Emilie Picard-Cantin (5min) Preference Elicitation for DCOPs Tiep Le (5min)
Workshops and Doctoral Program
Invited talks and Q&A - How to get the job you want after your PhD Professor Christian Schulte and Dr Sadegh Kharazmi
|12:00-13:30||Lunch break (lunch not provided)|
|13:30-15:30||Workshops and Doctoral Program
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs Bernhard Bliem (25min) Combining Solvers to Solve a Cryptanalytic Problem David Gerault (25min) Search strategies for floating point constraint systems Heytem Zitoun (5min) Computing LPMLN Using ASP and MLN Solvers Yi Wang (5min) An Efficient SMT Approach to Solve MRCPSP/max Instances with Tight Constraints on Resources Jordi Coll (5min) On Improving Run-time Checking in Dynamic Languages Nataliia Stulova (25min) Efficiently Computing Weighted Egalitarian Solutions For Multi-Objective Constraint Optimization Problems Emir Demirović (25min)
|15:30-16:00||Coffee, tea, refreshments|
|16:00-17:00||Workshops and Doctoral Program|
A Simple Complete Search for Logic Programming Jason Hemann (25min) Combining Stochastic Constraint Optimization and Probabilistic Programming: From Knowledge Compilation to Constraint Solving Anna Latour (5min) Constraint Handling in Flight Planning Anders Knudsen (5min) MDDs: Sampling and Probability Constraints Guillaume Perez (5min) NightSplitter: a scheduling tool to optimize (sub)group activities Tong Liu (5min) Dependency Learning for QBF Tomáš Peitl (5min) Productive Corecursion in Logic Programming Yue Li (5min)
|19:30-21:30||Doctoral Program Dinner|
Spaghetti Tree, 59 Bourke St
This year the co-located CP 2017, ICLP 2017 and SAT 2017 conferences are holding a joint Doctoral Program (DP). The DP is open to all students doing research on constraints, satisfiability or logic programming, including students that participated in previous DPs. It is a place where you can meet other student researchers, discuss your ongoing work in a relaxed atmosphere, as well as getting some mentoring from an experienced researcher in the field.
You can participate by submitting a paper about your ongoing research, or just the abstract if you have a paper accepted at either of the main conferences; see below for detailed instructions.
The program is a full-day event at the conference and includes presentations of the papers and mentoring by a senior researcher who will see your talk and and spend some time to discuss with you during the conference, as well as a nice (and free) dinner at the end of the day.
- June 19, 2017 - Submission deadline
- July 14, 2017 - Notification
- July 28, 2017 - Final version for online proceedings
- August 28, 2017 - Doctoral Program
Any student who does research on constraints (in the broadest sense), satisfiability or logic programming can participate. The submitted paper should contain work that is primarily the work of the student. It can be work in progress, completed work, or recently published work.
Students with a paper accepted at CP 2017, ICLP 2017 or SAT 2017 can participate by submitting just the abstract of the paper. They will still present at the doctoral program, but in lightning talk format (~3 minutes). All other students are required to submit a short paper (from 4 to 8 pages, excluding references). Submissions should be in the same style as CP 2017 papers (Springer LNCS), and the author list should specify who is the student and who are the advisors and other co-authors. Submissions are required to be in PDF format. All abstracts and papers should be submitted online through EasyChair by selecting “New Submission”. (If you are submitting an abstract only, please still submit a PDF containing the title, authors and abstract.)
On submitting a paper, you will be assigned another student’s paper to review. This is both to let you practice reviewing, and to share your impressions of the work with the other student. If your own submission is accepted, your mentor (see below) will discuss your review with you during the conference.
All students will be asked to present their work at the doctoral program. The presentation will be about 15 minutes long, followed by an open discussion. If you submitted an abstract of a paper accepted at CP, ICLP or SAT, the presentation will be a short 3 minute lighting talk, meant to motivate the audience to come see your full presentation.
Professor Christian Schulte (KTH Royal Institute of Technology, Sweden) and Dr Sadegh Kharazmi (Redbubble, Australia) have long experience in hiring PhD graduates for academic and industrial positions, and they have seen many PhD graduates apply for these jobs but fail. Together they will hold a question-and-answer discussion on what applicants commonly do wrong, and how you can avoid making these mistakes!
Financial support and accommodation
Financial support will be available for up to 20 students, covering accommodation in a twin shared room and the conference registration fees. We will allocate this funding based on students’ needs, so please email the DP chairs outlining your request for funding, and whether you have received funding for attending a Doctoral Program before. The request must be accompanied by a letter from the student’s supervisor confirming that the financial assistance is necessary for the student to participate in the DP.
There will be a free dinner on the evening of the doctoral program, open to all students selected for the doctoral program and chairs.
- Christopher Mears, Redbubble, Australia
- Neda Saeedloei, University of Minnesota Duluth, USA
You can contact the doctoral program co-chairs at firstname.lastname@example.org.