28th International Conference on Principles and
Practice of Constraint Programming (CP 2022)

Christine Solnon

► To cite this version:

Christine Solnon. 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). 2022. hal-03737001

HAL Id: hal-03737001

https://hal.science/hal-03737001v1

Submitted on 2 Apr 2023

HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.

L'archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diffusion de documents
scientifiques de niveau recherche, publiés ou non,
émanant des établissements d'enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.

<figure><img src="image_1.png" /></figure>

Distributed under a Creative Commons CC BY 4.0 - Attribution - International License
28th International Conference on
Principles and Practice of
Constraint Programming

CP 2022, July 31-August 8, 2022, Haifa, Israel

Edited by

Christine Solnon

<figure><img src="image_2.png" /></figure>

LIPICS

LIPICS - Vol. 235 - CP 2022

www.dagstuhl.de/lipics
Editors

Christine Solnon

INSA Lyon, CITI, Inria Chroma, France

christine.solnon@insa-lyon.fr

ACM Classification 2012

Computing methodologies → Artificial intelligence

ISBN 978-3-95977-240-2

Published online and open access by

Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, Germany. Online available at https://www.dagstuhl.de/dagpub/978-3-95977-240-2.

Publication date

July, 2022

Bibliographic information published by the Deutsche Nationalbibliothek

The Deutsche Nationalbibliothek lists this publication in the Deutsche Nationalbibliografie; detailed bibliographic data are available in the Internet at https://portal.dnb.de.

License

This work is licensed under a Creative Commons Attribution 4.0 International license (CC-BY 4.0):
https://creativecommons.org/licenses/by/4.0/legalcode.

In brief, this license authorizes each and everybody to share (to copy, distribute and transmit) the work under the following conditions, without impairing or restricting the authors' moral rights:

Attribution: The work must be attributed to its authors.

The copyright is retained by the corresponding authors.

<figure><img src="image_3.png" /></figure>

Digital Object Identifier: 10.4230/LIPIcs.CP.2022.0

ISBN 978-3-95977-240-2

ISSN 1868-8969

https://www.dagstuhl.de/lipics
LIPIcs – Leibniz International Proceedings in Informatics

LIPIcs is a series of high-quality conference proceedings across all fields in informatics. LIPIcs volumes are published according to the principle of Open Access, i.e., they are available online and free of charge.

Editorial Board

- Luca Aceto (Chair, Reykjavik University, IS and Gran Sasso Science Institute, IT)

- Christel Baier (TU Dresden, DE)

- Mikolaj Bojanczyk (University of Warsaw, PL)

- Roberto Di Cosmo (Inria and Université de Paris, FR)

- Faith Ellen (University of Toronto, CA)

- Javier Esparza (TU München, DE)

- Daniel Král' (Masaryk University - Brno, CZ)

- Meena Mahajan (Institute of Mathematical Sciences, Chennai, IN)

- Anca Muscholl (University of Bordeaux, FR)

- Chih-Hao Luke Ong (University of Oxford, GB)

- Phillip Rogaway (University of California, Davis, US)

- Eva Rotenberg (Technical University of Denmark, Lyngby, DK)

- Raimund Seidel (Universität des Saarlandes, Saarbrücken, DE and Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Wadern, DE)

ISSN 1868-8969

https://www.dagstuhl.de/lipics
<figure><img src="image_4.png" /></figure>
<figure><img src="image_5.png" /></figure>

# Contents

<table><tr><td>Preface<br><i>Christine Solnon</i></td><td>0:ix</td></tr><tr><td>Senior Program Committee</td><td>0:xi</td></tr><tr><td>Program Committee</td><td>0:xiii</td></tr><tr><td>List of Authors</td><td>0:xv</td></tr></table>

## Invited Talk

<table><tr><td>All Questions Answered<br><i>Donald E. Knuth</i></td><td>1:1–1:1</td></tr></table>

## Regular Papers

<table><tr><td>Fixed-Template Promise Model Checking Problems<br><i>Kristina Asimi, Libor Barto, and Silvia Butti</i></td><td>2:1–2:17</td></tr><tr><td>Improved Sample Complexity Bounds for Branch-And-Cut<br><i>Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, and Ellen Vitercik</i></td><td>3:1–3:19</td></tr><tr><td>Weisfeiler-Leman Invariant Promise Valued CSPs<br><i>Libor Barto and Silvia Butti</i></td><td>4:1–4:17</td></tr><tr><td>Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data<br><i>Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, and T. K. Satish Kumar</i></td><td>5:1–5:17</td></tr><tr><td>Acquiring Maps of Interrelated Conjectures on Sharp Bounds<br><i>Nicolas Beldiceanu, Jovial Cheukam-Ngouonou, Rémi Douence, Ramiz Gindullin, and Claude-Guy Quimper</i></td><td>6:1–6:18</td></tr><tr><td>Parallel Hybrid Best-First Search<br><i>Abdelkader Beldjilali, Pierre Montalbano, David Allouche, George Katsirelos, and Simon de Givry</i></td><td>7:1–7:10</td></tr><tr><td>Learning MAX-SAT Models from Examples Using Genetic Algorithms and Knowledge Compilation<br><i>Senne Berden, Mohit Kumar, Samuel Kolb, and Tias Guns</i></td><td>8:1–8:17</td></tr><tr><td>Complexity of Minimum-Size Arc-Inconsistency Explanations<br><i>Christian Bessiere, Clément Carbonnel, Martin C. Cooper, and Emmanuel Hebrard</i></td><td>9:1–9:14</td></tr></table>

28th International Conference on Principles and Practice of Constraint Programming (CP 2022).

Editor: Christine Solnon

<figure><img src="image_6.png" /></figure>

Leibniz International Proceedings in Informatics
LIPICS Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
<table>
  <tbody>
    <tr>
      <td>A Constraint Programming Approach to Ship Refit Project Scheduling<br><i>Raphaël Boudreault, Vanessa Simard, Daniel Lafond, and<br>Claude-Guy Quimper</i></td>
      <td>10:1-10:16</td>
    </tr>
    <tr>
      <td>On Redundancy in Constraint Satisfaction Problems<br><i>Clément Carbonnel</i></td>
      <td>11:1-11:15</td>
    </tr>
    <tr>
      <td>From Crossing-Free Resolution to Max-SAT Resolution<br><i>Mohamed Sami Cherif, Djamal Habet, and Matthieu Py</i></td>
      <td>12:1-12:17</td>
    </tr>
    <tr>
      <td>Isomorphisms Between STRIPS Problems and Sub-Problems<br><i>Martin C. Cooper, Arnaud Lequen, and Frédéric Maris</i></td>
      <td>13:1-13:16</td>
    </tr>
    <tr>
      <td>Solving the Constrained Single-Row Facility Layout Problem with Decision<br>Diagrams<br><i>Vianney Coppé, Xavier Gillard, and Pierre Schaus</i></td>
      <td>14:1-14:18</td>
    </tr>
    <tr>
      <td>Constraint Acquisition Based on Solution Counting<br><i>Christopher Coulombe and Claude-Guy Quimper</i></td>
      <td>15:1-15:16</td>
    </tr>
    <tr>
      <td>Computing Relaxations for the Three-Dimensional Stable Matching Problem<br>with Cyclic Preferences<br><i>Ágnes Cseh, Guillaume Escamocher, and Luis Quesada</i></td>
      <td>16:1-16:19</td>
    </tr>
    <tr>
      <td>DUELMIPs: Optimizing SDN Functionality and Security<br><i>Timothy Curry, Gabriel De Pace, Benjamin Fuller, Laurent Michel, and<br>Yan (Lindsay) Sun</i></td>
      <td>17:1-17:18</td>
    </tr>
    <tr>
      <td>A Framework for Generating Informative Benchmark Instances<br><i>Nguyen Dang, Özgür Akgün, Joan Espasa, Ian Miguel, and Peter Nightingale</i></td>
      <td>18:1-18:18</td>
    </tr>
    <tr>
      <td>Sequence Variables for Routing Problems<br><i>Augustin Delecluse, Pierre Schaus, and Pascal Van Hentenryck</i></td>
      <td>19:1-19:17</td>
    </tr>
    <tr>
      <td>CSP Beyond Tractable Constraint Languages<br><i>Jan Dreier, Sebastian Ordyniak, and Stefan Szeider</i></td>
      <td>20:1-20:17</td>
    </tr>
    <tr>
      <td>Explaining Propagation for Gini and Spread with Variable Mean<br><i>Alexander Ek, Andreas Schutt, Peter J. Stuckey, and Guido Tack</i></td>
      <td>21:1-21:16</td>
    </tr>
    <tr>
      <td>Plotting: A Planning Problem with Complex Transitions<br><i>Joan Espasa, Ian Miguel, and Mateu Villaret</i></td>
      <td>22:1-22:17</td>
    </tr>
    <tr>
      <td>Nucleus-Satellites Systems of OMDDs for Reducing the Size of Compiled Forms<br><i>Hélène Fargier, Jérôme Mengin, and Nicolas Schmidt</i></td>
      <td>23:1-23:18</td>
    </tr>
    <tr>
      <td>Heuristics for MDD Propagation in HADDOCK<br><i>Rebecca Gentzel, Laurent Michel, and Willem-Jan van Hoeve</i></td>
      <td>24:1-24:17</td>
    </tr>
    <tr>
      <td>An Auditable Constraint Programming Solver<br><i>Stephan Gocht, Ciaran McCreesh, and Jakob Nordström</i></td>
      <td>25:1-25:18</td>
    </tr>
    <tr>
      <td>From Cliques to Colorings and Back Again<br><i>Marijn J. H. Heule, Anthony Karahalios, and Willem-Jan van Hoeve</i></td>
      <td>26:1-26:10</td>
    </tr>
    <tr>
      <td>On the Enumeration of Frequent High Utility Itemsets: A Symbolic AI Approach<br><i>Amel Hidouri, Said Jabbour, and Badran Raddaoui</i></td>
      <td>27:1-27:17</td>
    </tr>
  </tbody>
</table>
<table>
  <tbody>
    <tr>
      <td>Understanding How People Approach Constraint Modelling and Solving<br><i>Ruth Hoffmann, Xu Zhu, Özgür Akgün, and Miguel A. Nacenta</i></td>
      <td>28:1–28:18</td>
    </tr>
    <tr>
      <td>Learning Constraint Programming Models from Data Using<br>Generate-And-Aggregate<br><i>Mohit Kumar, Samuel Kolb, and Tias Guns</i></td>
      <td>29:1–29:16</td>
    </tr>
    <tr>
      <td>Combining Reinforcement Learning and Constraint Programming for<br>Sequence-Generation Tasks with Hard Constraints<br><i>Daphné Lafleur, Sarath Chandar, and Gilles Pesant</i></td>
      <td>30:1–30:16</td>
    </tr>
    <tr>
      <td>Exploiting Functional Constraints in Automatic Dominance Breaking for<br>Constraint Optimization<br><i>Jimmy H. M. Lee and Allen Z. Zhong</i></td>
      <td>31:1–31:17</td>
    </tr>
    <tr>
      <td>A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for<br>Constraint Satisfaction Problems<br><i>Hongbo Li, Yaling Wu, Minghao Yin, and Zhanshan Li</i></td>
      <td>32:1–32:10</td>
    </tr>
    <tr>
      <td>Large Neighborhood Search for Robust Solutions for Constraint Satisfaction<br>Problems with Ordered Domains<br><i>Jheisson López, Alejandro Arbelaez, and Laura Climent</i></td>
      <td>33:1–33:16</td>
    </tr>
    <tr>
      <td>Scheduling the Equipment Maintenance of an Electric Power Transmission<br>Network Using Constraint Programming<br><i>Louis Popovic, Alain Côté, Mohamed Gaha, Franklin Nguewouo, and<br>Quentin Cappart</i></td>
      <td>34:1–34:15</td>
    </tr>
    <tr>
      <td>Peel-And-Bound: Generating Stronger Relaxed Bounds with Multivalued<br>Decision Diagrams<br><i>Isaac Rudich, Quentin Cappart, and Louis-Martin Rousseau</i></td>
      <td>35:1–35:20</td>
    </tr>
    <tr>
      <td>On Quantitative Testing of Samplers<br><i>Mate Soos, Priyanka Golia, Sourav Chakraborty, and Kuldeep S. Meel</i></td>
      <td>36:1–36:16</td>
    </tr>
    <tr>
      <td>Structured Set Variable Domains in Bayesian Network Structure Learning<br><i>Fulya Trösser, Simon de Givry, and George Katsirelos</i></td>
      <td>37:1–37:9</td>
    </tr>
    <tr>
      <td>Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints<br><i>Felix Ulrich-Oltean, Peter Nightingale, and James Alfred Walker</i></td>
      <td>38:1–38:17</td>
    </tr>
    <tr>
      <td>Completeness Matters: Towards Efficient Caching in Tree-Based Synchronous<br>Backtracking Search for DCOPs<br><i>Jie Wang, Dingding Chen, Ziyu Chen, Xiangshuang Liu, and Junsong Gao</i></td>
      <td>39:1–39:17</td>
    </tr>
    <tr>
      <td>CNF Encodings of Binary Constraint Trees<br><i>Ruiwei Wang and Roland H. C. Yap</i></td>
      <td>40:1–40:19</td>
    </tr>
    <tr>
      <td>Modeling and Solving Parallel Machine Scheduling with Contamination<br>Constraints in the Agricultural Industry<br><i>Felix Winter, Sebastian Meiswinkel, Nysret Musliu, and Daniel Walkiewicz</i></td>
      <td>41:1–41:18</td>
    </tr>
  </tbody>
</table>
<figure><img src="image_7.png" /></figure>
<figure><img src="image_8.png" /></figure>

# Preface

This volume contains the proceedings of the 28th International Conference on Principles and Practice of Constraint Programming (CP 2022), which was held in Haifa, Israel, August 1-5, 2022. Detailed information about the conference are available at https://cp2022.a4cp.org. CP 2022 was part of the Federated Logic Conference (FLoC) which is held every four years and brings together several leading international conferences related to logic for computer science. FLoC 2022 included 12 conferences, and CP was colocated with the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) and the 38th International Conference on Logic Programming (ICLP 2022), among other conferences.

Held annually, CP is the premier international conference on constraint programming. As is customary for CP, papers could be submitted to multiple tracks. A first technical track was concerned with all aspects of computing with constraints, including theory, algorithms, environments, languages, models, and systems. A second track, chaired by Helmut Simonis (University College Cork), was dedicated to applications of CP. The last three tracks were dedicated to interdisciplinary research at the intersection between constraint programming and other directly related fields: a Machine Learning track, chaired by Andrea Lodi (Cornell Tech), an Operations Research track, chaired by Sophie Demassey (Mines ParisTech), and a Trustworthy Decision Making track, co-chaired by Nadjib Lazaar (LIRMM), Pierre Marquis (Université d'Artois), and Barry O'Sullivan (University College Cork).

78 papers have been submitted to these tracks, and 40 of them have been accepted. Each paper has been reviewed by at least three members of the program committee. We considered a double blind reviewing process, meaning that authors and reviewers were anonymous to each other. Authors had the opportunity to answer reviewers and clarify possible misunderstandings through a rebuttal phase. For each paper, a senior program committee member was in charge of conducting a discussion with reviewers to find a consensus, and of writing a meta-review that summarised pros and cons. Finally, virtual meetings were organised between meta-reviewers, track chairs, and the program chair to agree on final decisions.

Four papers that had an average score greater than or equal to 2 (possible scores ranged from 3, corresponding to a strong accept, to -3, corresponding to a strong reject) were nominated by at least one program committee member for receiving a best paper award:

- *Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints*, from Felix Ulrich-Oltean, Peter Nightingale and James Alfred Walker;

- *A Constraint Programming Approach to Ship Refit Project Scheduling*, from Raphaël Boudreault, Vanessa Simard, Daniel Lafond and Claude-Guy Quimper;

- *Exploiting Functional Constraints in Generating Dominance Breaking Nogoods for Constraint Optimization*, from Jimmy H. M. Lee and Allen Z. Zhong;

- *Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams*, from Isaac Rudich, Quentin Cappart and Louis-Martin Rousseau.

The best two of them have been selected by a vote of senior PC members: the best paper prize was awarded to Isaac Rudich, Quentin Cappart and Louis-Martin Rousseau, and the best student paper prize was awarded to Jimmy H. M. Lee and Allen Z. Zhong.

We had the great honour and pleasure to have an invited talk given by Donald E. Knuth (Stanford University), whose next fascicle of *The Art of Computer Programming* is intended to be a solid introduction to techniques for solving Constraint Satisfaction Problems. An

<figure><img src="image_9.png" /></figure>
abstract of this talk is included in these proceedings. There was also two plenary FLoC invited speakers: Catuscia Palamidessi (INRIA Saclay, France), and Orna Kupferman (Hebrew University of Jerusalem, Israel).

Besides the paper tracks and invited talks, CP also had many other events, handled by special chairs: Ciaran McCreesh (University of Glasgow) organised the three workshops on the first day of the conference; Clément Carbonnel (LIRMM) selected tutorials for the main conference; Hélène Verhaeghe (Polytechnique Montréal) organised the Doctoral Program; Andrea Rendl (Satalia) organised a special event on diversity, equity, and inclusion; Eugene Freuder organised a CP App competition; Jason Nguyen, Peter J. Stuckey and Guido Tack (Monash University) organised the MiniZinc challenge; and Gilles Audemard, Christophe Lecoutre, and Emmanuel Lonca (Université d'Artois) organised the XCSP3 competition (both MiniZinc and XCSP3 competitions were part of the FLoC Olympic Games).

Many people have contributed to make this conference such a success, and I am grateful to all of them. First of all, I wish to thank all authors for their submission of high-quality scientific work, thus providing the material from which the conference is made. I am also very grateful to all chairs, who managed dedicated tracks and special events, to the senior Program Committee members who conducted numerous discussions with reviewers to reach consensual decisions, among other things, and to the Program Committee members who wrote 243 high-quality reviews and participated to numerous discussions. I would also like to thank the *Association for Constraint Programming* (ACP) for its trust and its very helpful organisation support, with a more specific thank to the ACP president, J. Christopher Beck (University of Toronto), and the ACP conference coordinator, Emmanuel Hebrard (LAAS-CNRS).

Finally, the conference would not have been possible without the great job done by all the people involved in the local organisation chaired by Alexandra Silva (Cornell University). I heavily relied on Roie Zivan (Ben Gurion University) and Ferdinando Fioretto (Syracuse University) for making the many necessary arrangements related to the CP 2022 program and to speedily announce program updates on the conference website.

May 2022, Lyon, France

Christine Solnon
<figure><img src="image_10.png" /></figure>

Senior Program Committee

André Ciré

David Cohen

Sophie Demassey

Ferdinando Fioretto

Pierre Flener

Maria Garcia de la Banda

Ian Gent

Emmanuel Hebrard

Zeynep Kiziltan

Christophe Lecoutre

Andrea Lodi

Ines Lynce

Barry O'Sullivan

Pierre Schaus

Helmut Simonis

Charlotte Truchet

Willem Van Hoeve

Roland Yap

University of Toronto

Oxford University

CMA research lab

Syracuse University

Uppsala University

Monash University

University of St. Andrews

LAAS-CNRS

University of Bologna

Université d'Artois

Cornell Tech

University of Lisboa

University College Cork

UCLouvain

Insight Centre for Data Analytics

University de Nantes

Carnegie Mellon University

National University of Singapore

<figure><img src="image_11.png" /></figure>
<figure><img src="image_12.png" /></figure>
Program Committee

<table><tr><td>Gilles Audemard</td><td>CRIL</td></tr><tr><td>Sebastien Bardin</td><td>CEA LIST</td></tr><tr><td>Chris Beck</td><td>University of Toronto</td></tr><tr><td>Nicolas Beldiceanu</td><td>IMT Atlantique</td></tr><tr><td>Jeremias Berg</td><td>University of Helsinki</td></tr><tr><td>David Bergman</td><td>University of Connecticut</td></tr><tr><td>Armin Biere</td><td>Albert-Ludwigs-University</td></tr><tr><td>Clément Carbonnel</td><td>CNRS</td></tr><tr><td>Mats Carlsson</td><td>RISE Research Institutes of Sweden</td></tr><tr><td>Martin Cooper</td><td>IRIT - Universite Paul Sabatier</td></tr><tr><td>Thi-Bich-Hanh Dao</td><td>University of Orleans</td></tr><tr><td>Simon de Givry</td><td>INRA - MIAT</td></tr><tr><td>Guillaume Derval</td><td>Liège Université</td></tr><tr><td>Agostino Dovier</td><td>Univ. di UDINE</td></tr><tr><td>Catherine Dubois</td><td>ENSIIE-Samovar</td></tr><tr><td>Jean-Guillaume Fages</td><td>COSLING S.A.S</td></tr><tr><td>Maria Andreina Francisco Rodriguez</td><td>Uppsala University</td></tr><tr><td>Xavier Gillard</td><td>Université Catholique de Louvain</td></tr><tr><td>Arnaud Gotlieb</td><td>Simula Research Laboratory</td></tr><tr><td>Tias Guns</td><td>Vrije Universiteit Brussel</td></tr><tr><td>John Hooker</td><td>Carnegie Mellon University</td></tr><tr><td>Marie-José Huguet</td><td>LAAS-CNRS Université de Toulouse</td></tr><tr><td>Alexey Ignatiev</td><td>Monash University</td></tr><tr><td>Mikolas Janota</td><td>Czech Technical University in Prague</td></tr><tr><td>Christopher Jefferson</td><td>University of St. Andrews</td></tr><tr><td>Serdar Kadioglu</td><td>Brown University</td></tr><tr><td>Roger Kameugne</td><td>University of Maroua</td></tr><tr><td>George Katsirelos</td><td>MIA Paris INRAE AgroParisTech</td></tr><tr><td>Lars Kotthoff</td><td>University of Wyoming</td></tr><tr><td>T. K. Satish Kumar</td><td>University of Southern California</td></tr><tr><td>Jean Marie Lagniez</td><td>CRIL</td></tr><tr><td>Nadjib Lazaar</td><td>UM2-LIRMM</td></tr><tr><td>Chu-Min Li</td><td>Université de Picardie Jules Verne</td></tr><tr><td>Arnaud Malapert</td><td>Université Côte d'Azur CNRS I3S</td></tr><tr><td>Felip Manyà</td><td>IIIA-CSIC</td></tr><tr><td>Pierre Marquis</td><td>CRIL U. Artois & CNRS</td></tr><tr><td>Ciaran McCreesh</td><td>University of Glasgow</td></tr><tr><td>Laurent Michel</td><td>University of Connecticut</td></tr><tr><td>Ian Miguel</td><td>University of St Andrews</td></tr><tr><td>Michela Milano</td><td>DISI Universita' di Bologna</td></tr><tr><td>Samba Ndojh Ndiaye</td><td>Liris</td></tr><tr><td>Peter Nightingale</td><td>University of York</td></tr><tr><td>Justin Pearson</td><td>Uppsala University</td></tr><tr><td>Laurent Perron</td><td>Google France</td></tr><tr><td>Gilles Pesant</td><td>Polytechnique Montréal</td></tr></table>

28th International Conference on Principles and Practice of Constraint Programming (CP 2022).

Editor: Christine Solnon

<figure><img src="image_13.png" /></figure>

Leibniz International Proceedings in Informatics
LIPICS Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
0:xiv Program Committee

<table>
  <tr>
    <td>Andreas Podelski</td>
    <td>University of Freiburg</td>
  </tr>
  <tr>
    <td>Enrico Pontelli</td>
    <td>New Mexico State University</td>
  </tr>
  <tr>
    <td>Cédric Pralet</td>
    <td>ONERA Toulouse</td>
  </tr>
  <tr>
    <td>Charles Prud'Homme</td>
    <td>IMT Atlantique LS2N</td>
  </tr>
  <tr>
    <td>Claude-Guy Quimper</td>
    <td>Laval University</td>
  </tr>
  <tr>
    <td>Louis-Martin Rousseau</td>
    <td>Polytechnique Montréal</td>
  </tr>
  <tr>
    <td>Michel Rueher</td>
    <td>Université Côte d'Azur CNRS I3S</td>
  </tr>
  <tr>
    <td>Domenico Salvagnin</td>
    <td>University of Padova</td>
  </tr>
  <tr>
    <td>Alexander Schiendorfer</td>
    <td>Technische Hochschule Ingolstadt</td>
  </tr>
  <tr>
    <td>Francesca Rossi</td>
    <td>IBM Research</td>
  </tr>
  <tr>
    <td>Thomas Schiex</td>
    <td>INRAE</td>
  </tr>
  <tr>
    <td>Andreas Schutt</td>
    <td>CSIRO and The University of Melbourne</td>
  </tr>
  <tr>
    <td>Mohamed Siala</td>
    <td>INSA Toulouse & LAAS-CNRS</td>
  </tr>
  <tr>
    <td>Laurent Simon</td>
    <td>Labri Bordeaux Institute of Technology</td>
  </tr>
  <tr>
    <td>Gilles Simonin</td>
    <td>Institut Mines Telecom - Atlantique</td>
  </tr>
  <tr>
    <td>Helge Spieker</td>
    <td>Simula Research Laboratory</td>
  </tr>
  <tr>
    <td>Kostas Stergiou</td>
    <td>University of Western Macedonia</td>
  </tr>
  <tr>
    <td>Peter J. Stuckey</td>
    <td>Monash University</td>
  </tr>
  <tr>
    <td>Guido Tack</td>
    <td>Monash University</td>
  </tr>
  <tr>
    <td>Cyril Terrioux</td>
    <td>LIS - UMR CNRS 7020 - Aix-Marseille Université</td>
  </tr>
  <tr>
    <td>Gilles Trombettoni</td>
    <td>LIRMM University of Montpellier</td>
  </tr>
  <tr>
    <td>Peter van Beek</td>
    <td>University of Waterloo</td>
  </tr>
  <tr>
    <td>Hélène Verhaeghe</td>
    <td>Polytechnique Montréal</td>
  </tr>
  <tr>
    <td>Petr Vilím</td>
    <td>IBM Czech</td>
  </tr>
  <tr>
    <td>Philippe Vismara</td>
    <td>SupAgro - MISTEA / LIRMM</td>
  </tr>
  <tr>
    <td>Neng-Fa Zhou</td>
    <td>CUNY Brooklyn College and Graduate Center</td>
  </tr>
</table>
List of Authors

Özgür Akgün (18, 28)
School of Computer Science,
University of St Andrews, UK

David Allouche (7)
Université Fédérale de Toulouse, ANITI,
INRAE, UR 875, 31326 Toulouse, France

Alejandro Arbelaez (33)
Department of Computer Engineering,
Autonomous University of Madrid, Spain

Kristina Asimi (2)
Department of Algebra, Faculty of Mathematics
and Physics, Charles University, Prague,
Czechia

Maria-Florina Balcan (3)
Computer Science and Machine Learning
Departments, Carnegie Mellon University,
Pittsburgh, PA, USA

Libor Barto (2, 4)
Department of Algebra, Faculty of Mathematics
and Physics, Charles University, Prague,
Czechia

Chaithanya Basrur (5)
Singapore Management University, Singapore

Nicolas Beldiceanu (6)
IMT Atlantique, LS2N (TASC), Nantes, France

Abdelkader Beldjilali (7)
Université Fédérale de Toulouse, INRAE, UR
875, 31326 Toulouse, France

Senne Berden (8)
Declarative Languages and Artificial Intelligence,
KU Leuven, Belgium

Christian Bessiere (9)
CNRS, University of Montpellier, France

Raphaël Boudreault (10)
Thales Digital Solutions, Québec, Canada

Silvia Butti (2, 4)
Department of Information and Communication
Technologies, Universitat Pompeu Fabra,
Barcelona, Spain

Quentin Cappart (34, 35)
Computer Engineering and Software Engineering
Department, Polytechnique Montréal, Canada

Clément Carbonnel (9, 11)
CNRS, University of Montpellier, France

Sourav Chakraborty (36)
Indian Statistical Institute Kolkata, India

Sarath Chandar (30)
Polytechnique Montréal, Canada;
Quebec Artificial Intelligence Institute (Mila),
Canada;
Canada CIFAR AI Chair, Toronto, Canada

Dingding Chen (39)
College of Computer Science,
Chongqing University, China

Ziyu Chen (39)
College of Computer Science,
Chongqing University, China

Mohamed Sami Cherif (12)
Aix-Marseille Univ, Université de Toulon, CNRS,
LIS, France

Jovial Cheukam-Ngouonou (6)
IMT Atlantique, LS2N (TASC), Nantes, France;
Université Laval, Québec, Canada

Laura Climent (33)
Department of Computer Engineering,
Autonomous University of Madrid, Spain

Martin C. Cooper (9, 13)
IRIT, University of Toulouse, France

Vianney Coppé (14)
UCLouvain, Louvain-la-Neuve, Belgium

Christopher Coulombe (15)
Université Laval, Québec, Canada

Ágnes Cseh (16)
Institute of Economics, Centre for Economic and
Regional Studies, Budapest, Hungary

Timothy Curry (17)
University of Connecticut, Storrs, CT, USA

Alain Côté (34)
IREQ, Varennes, Canada

Nguyen Dang (18)
School of Computer Science,
University of St Andrews, UK

Simon de Givry (7, 37)
Université Fédérale de Toulouse, ANITI,
INRAE, UR 875, 31326 Toulouse, France

Gabriel De Pace (17)
University of Rhode Island, Kingston, RI, USA
Augustin Delecluse (19)
TRAIL, ICTEAM, UCLouvain,
Louvain-la-Neuve, Belgium

Rémi Douence (6)
IMT Atlantique, LS2N, Inria, (Gallinette),
Nantes, France

Jan Dreier (20)
Algorithms and Complexity Group,
TU Wien, Austria

Alexander Ek (21)
Dept. of Data Science & AI, Monash University,
Melbourne, Australia;
CSIRO Data61, Melbourne, Australia

Guillaume Escamocher (16)
Insight Centre for Data Analytics, School of
Computer Science and Information Technology,
University College Cork, Ireland

Joan Espasa (18, 22)
School of Computer Science,
University of St Andrews, UK

Hélène Fargier (23)
IRIT, Université de Toulouse, CNRS,
Toulouse INP, UT3, France

Benjamin Fuller (17)
University of Connecticut, Storrs, CT, USA

Mohamed Gaha (34)
IREQ, Varennes, Canada

Junsong Gao (39)
College of Computer Science, Chongqing
University, China

Rebecca Gentzel (24)
University of Connecticut, Storrs, CT, USA

Xavier Gillard (14)
UCLouvain, Louvain-la-Neuve, Belgium

Ramiz Gindullin (6)
IMT Atlantique, LS2N (TASC), Nantes, France

Stephan Gocht (25)
Lund University, Sweden;
University of Copenhagen, Denmark

Priyanka Golia (36)
Indian Institute of Technology Kanpur, India;
National University of Singapore, Singapore

Tias Guns (8, 29)
Declarative Languages and Artificial Intelligence,
KU Leuven, Belgium

Djamal Habet (12)
Aix-Marseille Univ, Université de Toulon, CNRS,
LIS, France

Emmanuel Hebrard (9)
LAAS CNRS, Toulouse, France

Marijn J. H. Heule (26)
Carnegie Mellon University,
Pittsburgh, PA, USA

Amel Hidouri (27)
CRIL – CNRS UMR 8188,
University of Artois, France;
LARODEC, University of Tunis, Tunisia

Ruth Hoffmann (28)
School of Computer Science,
University of St Andrews, UK

Said Jabbour (27)
CRIL – CNRS UMR 8188,
University of Artois, France

Anthony Karahalios (26)
Carnegie Mellon University,
Pittsburgh, PA, USA

George Katsirelos (7, 37)
Université Fédérale de Toulouse, ANITI, INRAE,
MIA Paris, AgroParisTech, 75231 Paris, France

Donald E. Knuth (1)
Stanford University, CA, USA

Samuel Kolb (8, 29)
Declarative Languages and Artificial Intelligence,
KU Leuven, Belgium

Akshat Kumar (5)
Singapore Management University, Singapore

Mohit Kumar (8, 29)
Declarative Languages and Artificial Intelligence,
KU Leuven, Belgium

T. K. Satish Kumar (5)
University of Southern California,
Los Angeles, CA, USA

Daphné Lafleur (30)
Polytechnique Montréal, Canada;
Quebec Artificial Intelligence Institute (Mila),
Canada

Daniel Lafond (10)
Thales Digital Solutions, Québec, Canada

Jimmy H. M. Lee (31)
Department of Computer Science and
Engineering, The Chinese University of Hong
Kong, Shatin, China
Arnaud Lequen (13)
IRIT, University of Toulouse, France

Hongbo Li (32)
School of Information Science and Technology,
Northeast Normal University, Changchun, China

Zhanshan Li (32)
College of Computer Science and Technology,
Jilin University, Changchun, China

Xiangshuang Liu (39)
College of Computer Science,
Chongqing University, China

Jheisson López (33)
University College Cork, School of Computer
Science, Ireland;
SFI Centre for Research Training in Artificial
Intelligence, Cork, Ireland

Frédéric Maris (13)
IRIT, University of Toulouse, France

Ciaran McCreesh (25)
University of Glasgow, UK

Kuldeep S. Meel (36)
National University of Singapore, Singapore

Sebastian Meiswinkel (41)
MCP Algorithm Factory, MCP GmbH,
Wien, Austria

Jérôme Mengin (23)
IRIT, Université de Toulouse, CNRS,
Toulouse INP, UT3, France

Laurent Michel (17, 24)
University of Connecticut, Storrs, CT, USA

Ian Miguel (18, 22)
School of Computer Science,
University of St Andrews, UK

Pierre Montalbano (7)
Université Fédérale de Toulouse, ANITI,
INRAE, UR 875, 31326 Toulouse, France

Nysret Musliu (41)
Christian Doppler Laboratory for Artificial
Intelligence and Optimization for Planning and
Scheduling, DBAI, TU Wien, Austria

Miguel A. Nacenta (28)
Department of Computer Science,
University of Victoria, Canada

Franklin Ngewouo (34)
Hydro-Québec, Canada

Peter Nightingale (18, 38)
Department of Computer Science,
University of York, UK

Jakob Nordström (25)
University of Copenhagen, Denmark;
Lund University, Sweden

Sebastian Ordyniak (20)
Algorithms and Complexity Group,
University of Leeds, UK

Gilles Pesant (30)
Polytechnique Montréal, Canada

Louis Popovic (34)
Computer Engineering and Software Engineering
Department, Polytechnique Montréal, Canada

Siddharth Prasad (3)
Computer Science Department, Carnegie Mellon
University, Pittsburgh, PA, USA

Matthieu Py (12)
Aix-Marseille Univ, Université de Toulon, CNRS,
LIS, France

Luis Quesada (16)
Insight Centre for Data Analytics, School of
Computer Science and Information Technology,
University College Cork, Ireland

Claude-Guy Quimper (6, 10, 15)
Université Laval, Québec, Canada

Badran Raddaoui (27)
SAMOVAR, Télécom SudParis,
Institut Polytechnique de Paris, France

Louis-Martin Rousseau (35)
Mathematics and Industrial Engineering
Department, Polytechnique Montréal, Canada

Isaac Rudich (35)
Mathematics and Industrial Engineering
Department, Polytechnique Montréal, Canada

Tuomas Sandholm (3)
Computer Science Department, Carnegie Mellon
University, Pittsburgh, PA, USA;
Optimized Markets, Inc., Pittsburgh, PA, USA;
Strategic Machine, Inc., Pittsburgh, PA, USA;
Strategy Robot, Inc., Pittsburgh, PA, USA

Pierre Schaus (14, 19)
UCLouvain, Louvain-la-Neuve, Belgium

Nicolas Schmidt (23)
IRIT, Université de Toulouse, CNRS,
Toulouse INP, UT3, France
0:xviii **Authors**

Andreas Schutt (21)
CSIRO Data61, Melbourne, Australia

Vanessa Simard (10)
NQB.ai, Québec, Canada

Arambam James Singh (5)
National University of Singapore, Singapore

Arunesh Sinha (5)
Singapore Management University, Singapore

Mate Soos (36)
National University of Singapore, Singapore

Peter J. Stuckey (21)
Dept. of Data Science & AI, Monash University,
Melbourne, Australia

Yan (Lindsay) Sun (17)
University of Rhode Island, Kingston, RI, USA

Stefan Szeider (20)
Algorithms and Complexity Group,
TU Wien, Austria

Guido Tack (21)
Dept. of Data Science & AI, Monash University,
Melbourne, Australia

Fulya Trösser (37)
Université Fédérale de Toulouse, ANITI,
INRAE, UR 875, 31326 Toulouse, France

Felix Ulrich-Oltean (38)
Department of Computer Science,
University of York, UK

Pascal Van Hentenryck (19)
Georgia Institute of Technology,
Atlanta, GA, USA

Willem-Jan van Hoeve (24, 26)
Carnegie Mellon University,
Pittsburgh, PA, USA

Mateu Villaret (22)
Department of Computer Science, Applied
Mathematics and Statistics, University of
Girona, Spain

Ellen Vitercik (3)
Department of Electrical Engineering and
Computer Sciences, University of California
Berkeley, CA, USA

James Alfred Walker (38)
Department of Computer Science,
University of York, UK

Daniel Walkiewicz (41)
MCP Algorithm Factory, MCP GmbH,
Wien, Austria

Jie Wang (39)
College of Computer Science,
Chongqing University, China

Ruiwei Wang (40)
School of Computing, National University of
Singapore, Singapore

Felix Winter (41)
Christian Doppler Laboratory for Artificial
Intelligence and Optimization for Planning and
Scheduling, DBAI, TU Wien, Austria

Yaling Wu (32)
School of Information Science and Technology,
Northeast Normal University, Changchun, China

Roland H. C. Yap (40)
School of Computing, National University of
Singapore, Singapore

Minghao Yin (32)
School of Information Science and Technology,
Northeast Normal University, Changchun, China

Allen Z. Zhong (31)
Department of Computer Science and
Engineering, The Chinese University of Hong
Kong, Shatin, China

Xu Zhu (28)
School of Computer Science,
University of St Andrews, UK