You are here

CP 2015 Schedule

Download the CP and ICLP 2015 programme.

Monday August 31st

9:00am - 10:00am   Cross-Fertilization Between CSP and SAT (CSPSAT 2015)
Constraint Based Methods in Bioinformatics (WCB 2015)
Bin Packing and Placement Constraints (BPPC'15)
Doctoral Program
10:00am - 10:30am Coffee Break
10:30am - 12:00pm Constraint Modelling and Reformulation (ModRef 2015)
Cross-Fertilization Between CSP and SAT (CSPSAT 2015)
Constraint Based Methods in Bioinformatics (WCB 2015)
Bin Packing and Placement Constraints (BPPC'15)
Doctoral Program
12:00pm - 1:30pm Lunch Break
1:30pm - 3:00pm Constraint Modelling and Reformulation (ModRef 2015)
Cross-Fertilization Between CSP and SAT (CSPSAT 2015)
CP and Analytics
Workshop on Teaching Constraint Programming
Doctoral Program
3:00pm - 3:30pm Coffee Break
3:30pm - 5:30pm Constraint Modelling and Reformulation (ModRef 2015)
Cross-Fertilization Between CSP and SAT (CSPSAT 2015)
CP and Analytics
Workshop on Teaching Constraint Programming
Doctoral Program
5:30pm - 6:00pm Industrial Modelling Competition
7:00pm DP Dinner

Tuesday September 1st

8:45am - 9:00am Welcome
9:00am - 10:00am

Invited talk: Industrial Success Stories of ASP and CP: What's still open? (joint with CP'15)

Gerhard Friedrich, Institute of Applied Informatics, Universität Klagenfurt, Austria

This invited talk is sponsored by the European Coordinating Committee for Artificial Intelligence (ECCAI).

Session chair: Thomas Eiter, G.05
10:00am - 10:30am Coffee Break
10:30am - 12:00am

Best Papers (Joint with ICLP'15)

Session chairs: Gilles Pesant and Francesca Toni, G.05
CP Best Technical Paper: Projection, Consistency, and George Boole
John Hooker
CP Best Student Paper: On computing Minimal Independent Support and its applications to sampling and counting
Alexander Ivrii, Sharad Malik, Kuldeep S.  Meel and Moshe Vardi
ICLP Best Technical Paper: Complexity and Compilation of GZ-Aggregates in Answer Set Programming
Mario Alviano and Nicola Leone
12:00am - 1:30pm Lunch Break
1:45am - 3:00pm


Session chair: François Fages, G.01
Broken Triangles Revisited
Martin Cooper, Aymeric Duchein and Guillaume Escamocher
Upper and Lower Bounds on the Time Complexity of Infinite-domain CSPs
Peter Jonsson and Victor Lagerkvist
Pseudopolynomial simulation of DNNF by a Non-deterministic read-once branching program
Igor Razgon

Tutorial: Towards embedded Answer Set Solving (slides)

Torsten Schaub, University of Potsdam, Germany
Session chair: Willem-Jan Van Hoeve, G.03
3:00pm - 3:30pm Coffee Break
3:30pm - 5:10pm

Inference and Learning

Session chair: Michela Milano, G.01
Exact Sampling for Regular and Markov constraints with Belief Propagation
Alexandre Papadopoulos, Francois Pachet, Pierre Roy and Jason Sakellariou
Machine learning of Bayesian networks using constraint programming
Peter van Beek and Hella-Franziska Hoffmann
Revisiting the Limits of MAP Inference by MWSS on Perfect Graphs
Adrian Weller
Smallest MUS Extraction with Minimal Hitting Set Dualization
Alexey Ignatiev, Alessandro Previti, Mark Liffiton and Joao Marques-Silva


Session chair: Pierre Schaus, G.03
Joint Vehicle and Crew Routing and Scheduling
Edward Lam, Pascal Van Hentenryck and Philip Kilby
Modeling Universal Instruction Selection
Gabriel Hjort Blindell, Roberto Castañeda Lozano, Mats Carlsson and Christian Schulte
Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists
Craig Macdonald, Ciaran McCreesh, Alice Miller and Patrick Prosser
Open Packing for Facade-Layout Synthesis Under a General Purpose Solver
Andrés Felipe Barco Santa, Jean-Guillaume Fages, Elise Vareilles, Michel Aldanondo and Paul Gaborit
5:15pm - 6:15pm

ACP Annual General Meeting, G.03

6:30pm - 8:00pm

Welcome Reception

Aula Maxima

Wednesday September 2nd

9:00am - 10:00am

Invited talk: Synthesis of Constraint Solvers

Douglas Smith, Kestrel Institute, USA
Session chair: Christian Schulte. G.05
10:00am - 10:30am Coffee Break
10:30am - 12:10am

ACP Research Excellence and Doctoral Research Awards

Session chair: ACP EC. G.05
12:10am - 1:30pm Lunch Break (with posters)
1:45am - 3:00pm

Alternative and Hybrid Solvers

Session chair: Pedro Barahona. G.01
Representing and Solving Finite-Domain Constraint Problems using Systems of Polynomials
Christopher Jefferson, Peter Jeavons, Martin J. Green and M. R. C. van Dongen
Hybridization of Interval CP and Evolutionary Algorithms for Optimizing Difficult Problems
Charlie Vanaret, Jean-Baptiste Gotteland, Nicolas Durand and Jean-Marc Alliot

Tutorial: Lagrangian Relaxation for Domain Filtering (slides)

Hadrien Cambazard, G-SCOP - Grenoble Institute of Technology - School of Industrial Engineering, Grenoble, France
Session chair: David Bergman. G.03
3:00pm - 3:30pm Coffee Break
3:30pm - 5:10pm


Session chair: Peter Stuckey. G.01
Discrete Optimization with Decision Diagrams
David Bergman, Andre Augusto Cire, Willem-Jan van Hoeve and John Hooker
Strengthening Convex Relaxations with Bound Tightening for Power Network Optimization
Carleton Coffrin, Hassan Hijazi and Pascal Van Hentenryck
General bounding mechanism for Constraint Programs
Minh Hoàng Hà, Claude-Guy Quimper and Louis-Martin Rousseau
Improved Constraint Propagation via Lagrangian Decomposition
David Bergman, Andre Cire and Willem-Jan Van Hoeve


Session chair: Mats Carlsson. G.03
Solving Segment Routing Problems with Constraint Programming Techniques
Renaud Hartert, Pierre Schaus, Stefano Vissicchio and Olivier Bonaventure
Design and Evaluation of a Constraint-based Energy Saving and Scheduling Recommender System
Seán Óg Murphy, Oscar Manzano and Ken Brown
Scheduling Running Modes of Satellite Instruments Using Constraint-Based Local Search
Cédric Pralet, Solange Lemai-Chenevier and Jean Jaubert
A Constraint-Based Approach for the Differential Harvest Problem
Nicolas Briot, Christian Bessiere and Philippe Vismara

SPC Dinner

7:45pm - 9:45pm

LP/CP Programming Contest. G.08

Thursday September 3rd

9:00am - 10:00am

Invited talk: Constraint-based Problems and Solutions in the Global Enterprise

Claire Bagley, Oracle, USA
Session chair: Helmut Simonis. G.05
10:00am - 10:30am Coffee Break
10:30am - 12:10am

Applications and Best Application Paper

Session chair: Louis-Martin Rousseau. G.01
Long-Haul Fleet Mix and Routing Optimisation with Constraint Programming and Large Neighbourhood Search
Tommaso Urli and Philip Kilby
A Constraint Programming Approach for Non-Preemptive Evacuation Scheduling
Caroline Even, Andreas Schutt and Pascal Van Hentenryck
Constraint-based Local Search for Finding Node Disjoint Paths in Optical Access Networks
Alejandro Arbelaez, Deepak Mehta and Barry O'Sullivan
Constraint programming for LNG ship scheduling and inventory management
Willem-Jan van Hoeve

Randomness and Stochasticity

Session chair: Lars Kotthoff. G.03
Bounding an Optimal Search Path with a Game of Cop and Robber on graphs
Frédéric Simard, Michael Morin, Claude-Guy Quimper, François Laviolette and Josée Desharnais
General Game Playing with Stochastic CSP
Frédéric Koriche, Sylvain Lagrue, Eric Piette and Sébastien Tabary
Deterministic estimation of the expected makespan of a POS under duration uncertainty
Michele Lombardi, Alessio Bonfietti and Michela Milano
Randomness as a Constraint
Steven Prestwich, Roberto Rossi and Armagan Tarim
12:10am - 1:30pm Lunch Break
1:45am - 3:00pm

Industrial Problem Modelling (progress report)

Session chair: Helmut Simonis. G.08

Consistency and Propagation

Session chair: Christian Bessiere. G.03
Restricted Path Consistency Revisited
Kostas Stergiou
MDD Propagation for Sequence Constraints
David Bergman, Andre Augusto Cire and Willem-Jan van Hoeve
The Unary Resource with Transition Times
Cyrille Dejemeppe, Sascha Van Cauwelaert and Pierre Schaus

Tutorial: XCSP3 (slides)

Frederic Boussemart, Christophe Lecoutre and Cedric Piette
Session chair: Pierre Flener. G.01
3:00pm - 3:30pm Coffee Break
3:30pm - 5:10pm

CP Solution Showcase (poster session)

Session chair: Helmut Simonis. Foyer


Session chair: Michel Rueher. G.01
Visual Search Tree Profiling
Maxim Shishmarev, Christopher Mears, Guido Tack and Maria Garcia De La Banda
MiniSearch: a solver-independent meta-search language for MiniZinc
Andrea Rendl, Tias Guns, Peter J. Stuckey and Guido Tack
Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP
David Allouche, Simon de Givry, George Katsirelos, Thomas Schiex and Matthias Zytnicki
Conflict-Ordering Search
Steven Gay, Renaud Hartert, Christophe Lecoutre and Pierre Schaus


Session chair: John Hooker. G.03
Automatically Generating Streamlined Constraint Models with Essence and Conjure
James Wetter, Ozgur Akgun and Ian Miguel
Automatically Improving SAT Encoding of Constraint Problems through Common Subexpression Elimination in Savile Row
Peter Nightingale, Patrick Spracklen and Ian Miguel
Automated Auxiliary Variable Elimination through On-the-Fly Propagator Generation
Jean-Noël Monette, Pierre Flener and Justin Pearson
On the Reification of Global Constraints
Nicolas Beldiceanu, Mats Carlsson, Pierre Flener and Justin Pearson
6:00pm Banquet

Friday September 4th

9:00am - 9:10am

MiniZinc Challenge Results

9:10am - 10:00am


Session chair: Gilles Pesant. 1.07
On Tree-Preserving Constraints
Shufeng Kong, Sanjiang Li, Yongming Li and Zhiguo Long
A Microstructure-based Family of Tractable Classes for CSPs
Martin Cooper, Philippe Jégou and Cyril Terrioux
10:00am - 10:30am Coffee Break
10:30am - 12:10am

Global Constraints

Session chair: Christian Bessiere. G.01
Using Finite Transducers for Describing and Synthesising Structural Time-Series Constraints
Nicolas Beldiceanu, Mats Carlsson, Remi Douence and Helmut Simonis
PREFIX-PROJECTION Global Constraint for Sequential Pattern Mining
Amina Kemmar, Samir Loudni, Lebbah Yahia, Patrice Boizumault and Thierry Charnois
Achieving Domain Consistency and Counting Solutions for Dispersion Constraints
Gilles Pesant
A Global Constraint for a Tractable Class of Temporal Optimization Problems
Alban Derrien, Jean-Guillaume Fages, Thierry Petit and Charles Prud'Homme


Session chair: Steve Prestwich. G.03
meSAT: Multiple Encodings of CSP to SAT
Mirko Stojadinović and Filip Marić
Smaller Selection Networks for Cardinality Constraints Encoding
Michał Karpiński and Marek Piotrów
Encoding Linear Constraints with Implication Chains to CNF
Ignasi Abío, Valentin Mayer-Eichberger and Peter J. Stuckey
Generalized Totalizer Encoding for Pseudo-Boolean Constraints
Saurabh Joshi, Ruben Martins and Vasco Manquinho
12:10am - 1:30pm Lunch Break
1:45am - 3:00pm

Distributed and Parallel Computation

Session chair: Patrick Prosser. G.03
A General Framework for Reordering Agents Asynchronously in Distributed CSP
Mohamed Wahbi, Younes Mechqrane, Christian Bessiere and Ken Brown
Exploiting GPUs in Solving (Distributed) Constraint Optimization Problems with Dynamic Programming
Ferdinando Fioretto, Tiep Le, Enrico Pontelli, William Yeoh and Tran Cao Son
A Parallel, Backjumping Subgraph Isomorphism Algorithm using Supplemental Graphs
Ciaran McCreesh and Patrick Prosser

Tutorial: Constraints and Bioinformatics: results and challenges (slides)

Agostino Dovier, University of Udine, Italy
Session chair: Pierre Flener. G.01
3:00pm - 3:30pm Coffee Break
3:30pm - 5:10pm


Session chair: Nicolas Beldiceanu. G.01
Modeling and Solving Project Scheduling with Calendars
Stefan Kreter, Andreas Schutt and Peter J. Stuckey
Simple and Scalable time-table filtering for the Cumulative Constraint
Steven Gay, Renaud Hartert and Pierre Schaus
Two Clause Learning Approaches for Disjunctive Scheduling
Mohamed Siala, Christian Artigues and Emmanuel Hebrard


Session chair: Peter van Beek. G.03
Optimizing the Cloud Service Experience using Constraint Programming
Serdar Kadioglu, Michael Colena, Steven Huberman and Claire Bagley
Find Your Way Back: Mobility Profile Mining with Constraints
Lars Kotthoff, Mirco Nanni, Riccardo Guidotti and Barry O'Sullivan
Constrained Mimimum Sum of Squares Clustering by Constraint Programming
Thi-Bich-Hanh Dao, Khanh-Chuong Duong and Christel Vrain
Power Capping in High Performance Computing systems
Andrea Borghesi, Michele Lombardi, Michela Milano and Luca Benini

Saturday September 5th

9:30am - 6:00pm CSPlib sprint