Program

Parallel sessions are highlighted with different colors: red, blue, ... You can search for specific author/title or browse on the different days of the conference.
PDF version

Workshops are highlighted with a given color. You can click on a specific workshop in order to only focus on its program (click again to see all of them).

Constraints & AI Planning Graphs and Constraints Holy Grail ModRef DP

08:30 - 09:00Registration

09:00 - 10:30Constraints & AI Planning(Room 2)

  • Malte Helmert.
    AI Planning tutorial
  • Invited Talk: Patrik Haslum.
    Planning with State and Trajectory Constraints

09:30 - 10:30Graphs and Constraints(Meeting Room 2)

  • Invited Talk: Ciaran McCreesh.
    When hard subgraph problems are really hard, and why it matters

09:00 - 10:30Progress Towards the Holy Grail(Meeting Room 1)

  • KeyNote: Jean-François Puget (IBM)
    Cognitive Optimization
  • Invited Talk: Luc De Raedt (KU Leuven)
    Learning Constraints from Examples

09:00 - 09:10DP(Room 1)

  • Welcome (DP Chairs)

09:10 - 10:00DP(Room 1)

  • Invited Talk: Lakdhar Saïs.
    Towards cross-fertilization between Data Mining and Constraints

10:00 - 10:30DP(Room 1)

    * : 15 minutes of presentation + 5 questions. ** : 3 minutes of presentation
  • Giovanni Lo Bianco.
    Probabilistic Model to Count Solutions on Cardinality Constraints *
  • Rohan Fossé.
    On the non-Degeneracy of Unsatisfiability Proof Graphs produced by SAT Solvers **
  • Aditya Shrotri.
    Not All FPRASs are Equal: Demystifying FPRASs for DNF-Counting **
  • Anthony Palmieri.
    Constraint Games for stable and optimal allocation of demands in SDN **

10:30 - 11:00Coffee break

11:00 - 12:30Constraints & AI Planning(Room 2)

  • Emre Okkes Savas, Chiara Piacentini.
    Extending a MILP Compilation for Numeric Planning Problems to Include Control Parameters
  • Elad Denenberg, Amanda Coles.
    Expressive Plannning by Combining Forward Search and Mixed-Integer Programming
  • Open discussion

11:00 - 12:30Graphs and Constraints(Meeting Room 2)

  • Fraser Dunlop, Peter Nightingale and András Z. Salamon.
    Graph connectivity via local minimality
  • Fraser Dunlop, Jessica Enright, Chris Jefferson, Ciaran McCreesh, Patrick Prosser and James Trimble.
    Expression of Graph Problems in a High Level Modelling Language
  • Michael Codish, Thorsten Ehlers, Graeme Gange, Avi Itzhakov and Peter J. Stuckey.
    Breaking Symmetries with Lex Implications

11:00 - 12:30Progress Towards the Holy Grail(Meeting Room 1)

  • Michael Sioutis and Amy Loutfi.
    Efficient Dynamic Methods for Qualitative Constraint-based Spatial and Temporal Reasoning
  • Sara Sahbaoui and Imade Benelallam.
    Deep learning combined to NLP-based approach for constraint acquisition problems
  • Ekaterina Arafailova, Nicolas Beldiceanu and Helmut Simonis.
    Automatically Mining and Proving Generic Invariants on Integer Sequences
  • Gilles Pesant.
    From Support Propagation to Belief Propagation in Constraint Programming
  • Eugene C. Freuder.
    Complete Explanations

11:00 - 12:30DP(Room 1)

  • Aurélie Massart.
    Testing Global Constraints *
  • Fanghui Liu.
    A complete tolerant algebraic side-channel attack for AES with CP **
  • Tomáš Peitl.
    Portfolio-based algorithm selection for circuit QBFs **
  • Dimosthenis Tsouros.
    Efficient Methods for Constraint Acquisition **
  • Kiana Zeighami.
    Towards Automating Learning-based Model Transformation **
  • Massimo Bono.
    Decremental Consistency Checking of Temporal Constraints: Algorithms for the Point Algebra and the ORD-Horn Class **
  • Rémy Garcia.
    Towards a constraint system for round-off error analysis of floating-point computation *
  • Michał Karpiński.
    Encoding Cardinality Constraints using Multiway Merge Selection Networks **
  • Jip Dekker.
    Solver-independent Large Neighbourhood Search **
  • Khoi Hoang.
    A Large Neighboring Search Schema for Multi-Agent Optimization **
  • Patrick Spracklen.
    Automatic Generation and Selection of Streamlined Constraint Models via Monte Carlo Search on a Model Lattice **
  • Ghiles Ziat.
    Finding solutions by finding inconsistencies **
  • Heytem Zitoun.
    Sub-domain Selection Strategies For Floating Point Constraint Systems *

12:30 - 14:00Lunch

14:00 - 15:30Constraints & AI Planning(Room 2)

  • Invited Talk: Peter Stuckey
    Sequencing Operator Counts
  • Augusto B. Corrêa, Florian Pommerening, Guillem Francès
    Relaxed Decision Diagrams for Delete-Free Planning
  • Open discussion

14:00 - 15:30Graphs and Constraints(Meeting Room 2)

  • Antoine Amarilli and Charles Paperman.
    Topological Sorting with Regular Constraints
  • Leonardo Duenas-Osorio, Kuldeep S. Meel, Roger Paredes and Moshe Y. Vardi.
    Counting-Based Reliability Estimation for Power-Transmission Grids
  • Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider.
    Weighted Counting for Constraint Satisfaction with Default Values: Algorithms and Complexity Results

14:00 - 15:30Progress Towards the Holy Grail(Meeting Room 1)

  Panel: Progress Towards the Holy Grail
  • Barry O'Sullivan (University College Cork, Ireland):Acquisition
  • Ian Miguel (University of St Andrews, Scotland):Modelling
  • Holger Hoos (Leiden University, The Netherlands):Solving
  • Narendra Jussien (École des Mines d'Albi-Carmaux, France):Explanation

14:00 - 15:30ModRef(Meeting Room 3)

  • Invited Talk: Michele Lombardi.
    Empirical Constraint Model Learning
  • Özgür Akgün and Ian Miguel.
    Modelling Langford's Problem: A Viewpoint for Search
  • Ruth Hoffmann, Özgür Akgün and Susmit Sarkar.
    Memory Consistency Models using Constraints
  • Andrea Rendl and Christina Burt.
    Demand-driven Delivery Staff Rostering

14:00 - 14:50DP(Room 1)

  • Invited Talk: Claude-Guy Quimper.
    Improving the Energetic Reasoning: How I followed 15-year-old advice from my supervisor

14:50 - 15:30DP(Room 1)

  • Mathieu Collet.
    Constraint-based Generation of Trajectories for Single-Arm Robots *
  • Saad Attieh.
    Local search of Essence, a proof of concept *

15:30 - 16:00Coffee break

16:00 - 18:00Constraints & AI Planning(Room 2)

  • Stéphane Cardon
    GPU-based CSP for Action Planning
  • Ionut Moraru, Moisés Martínez, Stefan Edelkamp
    Automated Pattern Selection using MiniZinc
  • Guillem Francès, Hector Geffner
    Constraint Propagation and Embedded CSPs in Forward-Search Planning
  • Open discussion

16:00 - 18:00Progress Towards the Holy Grail(Meeting Room 1)

  Discussion: Roadmap for Further Progress
  • Scientific: Goals, Milestones, etc.
  • Support: Collaborations, Resources, etc.

16:00 - 18:00ModRef(Meeting Room 3)

  • Invited Talk: Helmut Simonis.
    Considering Feedback Loops in Constraint Programming Methodology
  • Ekaterina Arafailova, Nicolas Beldiceanu, Mats Carlsson, Rémi Douence, María Andreína Francisco Rodríguez and Helmut Simonis.
    A Transducer-Based Model for Representing Functional Constraints on Integer Sequences
  • Tias Guns, Peter J. Stuckey and Guido Tack.
    Solution Dominance over Constraint Satisfaction Problems
  • Saad Attieh, Christopher Jefferson, Ian Miguel and Peter Nightingale.
    Towards Solving Essence With Local Search: a Proof of Concept Using Sets and Multisets
  • Christian Artigues, Emmanuel Hebrard, Yannick Pencolé, Andreas Schutt and Peter J. Stuckey.
    A Study of Evacuation Planning for Wildfires

16:00 - 18:00DP(Room 1)

  • Shan He.
    A Fast and Scalable Algorithm for Scheduling Large Numbers of Devices under Real-Time Pricing **
  • Mohamed-Bachir Belaid.
    A Global Constraint for Mining Generator Itemsets *
  • Dimitri Justeau-Allaire.
    Unifying Reserve Design Strategies with Graph Theory and Constraint Programming **
  • Gökberk Koçak.
    Maximal Frequent Itemset Mining with Non-monotonic Side Constraints *
  • Linnea Ingmar.
    Making Compact-Table Compact **
  • Maxime Chabert.
    A Global Constraint for the Exact Cover Problem: Application to Conceptual Clustering **
  • Arthur Godet.
    Deriving filtering algorithms from approximation algorithms: zoom on the Bin Packing problem *
  • James Trimble.
    Three New Approaches for the Maximum Common Edge Subgraph Problem *

19:30 - 22:00DP Dinner

08:45 - 09:00Welcome

09:00 - 10:00Invited talk(Auditorium - Chair: John Hooker)

  • Malte Helmert.
    Constraints at the Heart of Classical Planning

10:00 - 10:30Coffee break

10:30 - 12:10Learning(Auditorium - Chair: Eugene Freuder)

  • Holger Hoos, Tomáš Peitl, Friedrich Slivovsky and Stefan Szeider.
    Portfolio-based algorithm selection for circuit QBFs
  • Dimosthenis C. Tsouros, Kostas Stergiou and Panagiotis G. Sarigiannidis.
    Efficient methods for constraint acquisition
  • Kiana Zeighami, Kevin Leo, Guido Tack and Maria Garcia De La Banda.
    Towards semi-automatic learning-based model transformation
  • Edward Zulkoski, Ruben Martins, Christoph M. Wintersteiger, Robert Robere, Jia Liang, Krzysztof Czarnecki and Vijay Ganesh.
    Learning sensitive backdoors with restarts

10:30 - 12:10Data Analysis Track(Room 2 - Chair: Tias Guns)

  • Christian Bessiere, Nadjib Lazaar and Mehdi Maamar.
    User’s constraints in itemset mining
  • Said Jabbour, Fatima Ezzahra Mana, Imen Ouled Dlala, Badran Raddaoui and Lakhdar Sais.
    On maximal frequent itemsets mining with constraints
  • Imen Ouled Dlala, Said Jabbour, Badran Raddaoui and Lakhdar Sais.
    A parallel SAT based framework for closed frequent itemsets mining
  • Hong Xu, Sven Koenig and T. K. Satish Kumar.
    Effective deep learning for constraint satisfaction problems

12:10 - 14:00Lunch

14:00 - 15:00Tutorial 1(Room 2)

  • Robert Fourer.
    Model-Based Optimization: Principles and Trends (AMPL)

    As optimization methods have been applied more broadly and effectively, a key factor in their success has been the adoption of a model-based approach. A researcher or analyst focuses on modeling the problem of interest, while the computation of a solution is left to general-purpose, off-the-shelf solvers; independent modeling languages and systems manage the difficulties of translating between the human modeler’s ideas and the computer software’s needs. This tutorial introduces model-based optimization with examples from the AMPL modeling language and various popular solvers; the presentation concludes by surveying current software, with special attention to the role of constraint programming.

14:00 - 15:00Tutorial 2(Auditorium)

  • Özgür Akgün, Peter Nightingale.
    Automated Modelling with Conjure and Savile Row

    Effective modelling has been recognised as a key challenge in constraints for many years. We describe an approach to automated modelling at two different levels of abstraction: class-level model generation and instance-level model reformulation. The former is realised in Conjure: it produces multiple solver-independent models from an Essence problem specification. The latter is performed by Savile Row: it produces tailored models for one of several target solvers. Together they comprise a pipeline of tools that require minimal input from a user to perform high-performance constraint solving.


15:00 - 15:50CP with quantifiers(Room 2 - Chair: Maria Garcia De La Banda)

  • Florian Lonsing and Uwe Egly.
    
Evaluating QBF solvers: Quantifier alternations matter
  • Florent Madelaine and Stéphane Secouard.
    The quantified valued constraint satisfaction problem

15:00 - 15:50CP/OR Track(Auditorium - Chair: Laurent Michel)

  • Waldemar Cruz, Fanghui Liu and Laurent Michel.
    Securely and automatically deploying micro-services in an hybrid cloud infrastructure
  • Alexander Tesch.

    Improving energetic propagations for cumulative scheduling

15:50 - 16:15Coffee break

16:15 - 17:15Panel: CP and Automated Planning (Auditorium)

17:15 - 18:00CP competitions (Auditorium)

  • XCSP3 competition
  • Minizinc challenge

18:00 - 20:00Welcome reception

09:00 - 10:00Invited talk(Auditorium - Chair: John Hooker)

  • James Cussens.
    Towards the Holy Grail in Machine Learning

10:00 - 10:30Coffee break

10:30 - 12:10SAT/SMT(Room 2 - Chair: Lakhdar Saïs)

  • Johannes K. Fichte, Markus Hecher, Neha Lodha and Stefan Szeider.
    An SMT approach to fractional hypertree width
  • Gael Glorian, Jean Marie Lagniez, Valentin Montmirail and Michael Sioutis.
    An incremental SAT-based approach to reason efficiently on qualitative constraint network
  • Saurabh Joshi, Prateek Kumar, Ruben Martins and Sukrut Rao.

    Approximation strategies for incomplete maxSAT
  • Kuldeep S. Meel, Aditya A. Shrotri and Moshe Y. Vardi.

    Not all FPRASs are equal: Demystifying FPRASs for DNF-counting

10:30 - 12:10Application Track(Auditorium - Chair: Meinolf Sellmann)

  • Gleb Belov, Tobias Czauderna, Maria Garcia De La Banda, Matthias Klapperstueck, Ilankaikone Senthooran, Mark Wallace, Michael Wybrow and Mitch Smith.
    Process plant layout optimization: Equipment allocation
  • Quentin Cappart, Charles Thomas, Pierre Schaus and Louis-Martin Rousseau.
    
"A constraint programming approach for solving patient transportation problems
  • Dimitri Justeau-Allaire, Philippe Birnbaum and Xavier Lorca.
    
"Unifying reserve design strategies with graph theory and constraint programming
  • Anthony Palmieri, Arnaud Lallouet and Luc Pons.
    
"Constraint Games for stable and optimal allocation of demands in SDN

12:10 - 14:00Lunch

14:00 - 15:00Tutorial 3(Room 2)

  • Peter Stuckey and Guido Tack.
    MiniZinc: An Expressive Extensible Modelling Language

    MiniZinc is a modelling language that incorporates some features of general programming languages. The user can write predicates and functions to encapsulate modelling concepts that they wish to reuse within and across models.  Predicates capture global constraints, making MiniZinc a natural language for modelling CP problems.   MiniZinc translates a user's model into a form that is required for a target solver, whether it is a CP, MIP, SMT or local search solver. This allows easy experimentation with different solvers and solving technology for the same problem.

    In this tutorial we will demonstrate how to rapidly build applications with MiniZinc, and illustrate some of the new features of MiniZinc 2.2.0 including building teaching projects that provide automatic feedback, automatic modelling improvement suggestions using Globalizer, and debugging incorrect models using hierarchical Minimal Unsatisfiable Set (MUS) detection. 

14:00 - 15:00Tutorial 4(Auditorium)

  • Jimmy Liang.
    Machine Learning for SAT Solvers

    SAT solvers heavily rely on a handful of heuristics for their surprising effectiveness in solving large practical instances. In this tutorial, we first review the inner workings of modern solvers and what makes them so effective. We then discuss the design of recent machine learning-based heuristics with the objective of minimizing running time by leveraging the enormous amount of data generated by SAT solvers.


15:00 - 15:50SAT solvers(Room 2 - Chair: Stefan Szeider)

  • Rohan Fossé and Laurent Simon.
    On the non-degeneracy of unsatisfiability proof graphs produced by SAT solvers
  • Edward Zulkoski, Ruben Martins, Christoph M. Wintersteiger, Jia Liang, Krzysztof Czarnecki and Vijay Ganesh..
    The effect of structural measures and merges on SAT solver performance

15:00 - 15:50Applications and Power System Management Tracks(Audtorium - Chair: Bhagyesh Patil)

  • Carlos Ansotegui, Meinolf Sellmann, and Kevin Tierney.
    Self-configuring cost-sensitive hierarchical clustering with recourse
  • Shan He, Mark Wallace, Campbell Wilson, Ariel Liebman and Graeme Gange..
    A fast and scalable algorithm for scheduling large numbers of devices under real-time pricing

15:50 - 16:15Coffee break

16:15 - 17:30Awards(Auditorium - Chair: Laurent Michel)

  • ACP Distinguished Service Award presentation
    Michela Milano
  • CP 2018 Best Paper Award
    Emmanuel Hebrard and George Katsirelos.
    Clause learning and new bounds for graph coloring
  • 2018 ACP Doctoral Dissertation Award
    Ciaran McCreesh.
    Solving hard subgraph problems in parallel

17:30 - 18:45Upcoming conference announcements and ACP meeting

09:00 - 10:00Invited talk(Auditorium - Chair: John Hooker)

  • Srinivas Bollapragada.
    Potential Applications of CP in Industrial Scheduling

10:00 - 10:30Coffee break

10:30 - 12:10Symmetry, Learning, and Noise Analysis(Auditorium - Chair: Charlotte Truchet)

  • Graeme Gange and Peter J. Stuckey.
    
Sequential precede chain for value symmetry elimination
  • Martin Cooper, Wafa Jguirim and David Cohen.
    Domain reduction for valued constraints by generalising methods from CSP
  • Dmitry Malioutov and Kuldeep S. Meel.
    
MLIC: A maxSAT-based framework for learning interpretable classification rules
  • Guillaume Perez, Brendan Hogan Rappazzo and Carla Gomes.
    Extending the capacity of 1/f noise generation

10:30 - 12:10Multiagent & Parallel CP Track(Room 2 - Chair: William Yeoh)

  • Liel Cohen and Roie Zivan.
    Balancing asymmetry in max-sum using split constraint factor graphs
  • Khoi Hoang, Ferdinando Fioretto, William Yeoh, Enrico Pontelli and Roie Zivan.
    A large neighboring search schema for multi-agent optimization
  • Vadim Levit and Amnon Meisels.
    Distributed constrained search by selfish agents for efficient equilibria

12:10 - 14:00Lunch

14:00 - 15:00Tutorial 5(Auditorium)

  • Sebastién Lannez.
    Xpress Mosel tutorial: Modelling and Solving Optimization Problems with Various Solvers

14:00 - 14:50Testing and Verification Track(Room 2 - Chair: Nadjib Lazaar)

  • Özgür Akgün, Ian Gent, Christopher Jefferson, Ian Miguel and Peter Nightingale.
    Metamorphic testing of constraint solvers
  • Saeed Nejati, Jan Horacek, Catherine Gebotys and Vijay Ganesh.
    Algebraic fault attack on SHA hash functions using programmatic SAT solvers

16:00 - 18:00Excursion in Lille

19:00 - 23:00Dinner Gala (Omnia restaurant)

09:00 - 10:15Table constraints(Auditorium - Chair: George Katsirelos)

  • Özgür Akgün, Ian Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale and András Salamon.
    
Automatic discovery and exploitation of promising subproblems for tabulation
  • Linnea Ingmar and Christian Schulte.
    Making compact-table compact
  • Anthony Schneider and Berthe Choueiry..
    PW-CT: Extending Compact-Table to Enforce Pairwise Consistency on Table Constraints

09:00 - 10:15Temporal constraints(Room 2 - Chair: Arnaud Lallouet)

  • Arthur Bit-Monnot.
    A Constraint-based encoding for domain-independent temporal planning
  • Massimo Bono and Alfonso Emilio Gerevini.
    Decremental consistency checking of temporal constraints: Algorithms for the point algebra and the ORD-Horn class
  • Jasper C. H. Lee, Jimmy H. M. Lee and Allen Z. Zhong.
    Augmenting stream constraint programming with eventuality conditions

10:15 - 10:45Coffee break

10:45 - 12:00Global constraints(Room 2 - Chair: Gilles Pesant)

  • Roberto Amadini, Graeme Gange and Peter J. Stuckey.
    Propagating regular membership with dashed strings
  • Michał Karpiński and Marek Piotrów.
    Encoding cardinality constraints using multiway merge selection networks
  • Philippe Vismara and Nicolas Briot.
    A circuit constraint for multiple tours problems

10:45 - 12:00Search(Auditorium - Chair: Guido Tack)

  • Anthony Palmieri and Guillaume Perez.
    Objective as a feature for robust search strategies
  • Patrick Spracklen, Özgür Akgün and Ian Miguel.
    Automatic generation and selection of streamlined constraint models via Monte Carlo search on a model lattice
  • Ghiles Ziat, Marie Pelleau, Charlotte Truchet and Antoine Miné.
    Finding solutions by finding inconsistencies

12:00 - 13:30Lunch

13:30 - 14:20Applications(Auditorium - Chair: TBA)

  • Meriem Khelifa, Dalila Boughaci and Esma Aimeur.
    A novel graph-based heuristic approach for solving sport scheduling problem
  • Fanghui Liu, Waldemar Cruz and Laurent Michel.
    A complete tolerant algebraic side-channel attack for AES with CP

13:30 - 14:20Local search(Room 2 - Chair: Emir Demirović)

  • Jip J. Dekker, Maria Garcia De La Banda, Andreas Schutt, Peter J. Stuckey and Guido Tack.
    Solver-independent large neighborhood search
  • Emir Demirović, Geoffrey Chu and Peter J. Stuckey.
    Solution-based phase saving for CP: A value-selection heuristic to simulate local search behavior in complete solvers