CP 2021

Papers (125)

Xiangshuang Liu, Ziyu Chen, Dingding Chen, Junsong Gao
A Bound-Independent Pruning Technique to Speeding Up Tree-based Complete Search Algorithms for Distributed Constraint Optimization Problems
Ágnes Cseh, Guillaume Escamocher, Begüm Genç, Luis Quesada
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences
Cristian Galleguillos, Zeynep Kiziltan, Ricardo Soto
A Job Dispatcher for Large and Heterogeneous HPC Systems Running Modern Applications
Nicolas Isoart, Jean-Charles Regin
A k-opt based constraint for the TSP5forum
Nicolas Isoart, Jean-Charles Regin
A linear time algorithm for the k-cutset constraint
Marco Baioletti, Riccardo Rasconi, Angelo Oddi
A novel ant colony optimization strategy for the quantum circuit compilation problem
Jordi Coll, Joan Espasa Arxer, Ian Miguel, Mateu Villaret
A Preliminary Case Study of Planning With Complex Transitions: Plotting
Boro Sofranac, Ambros Gleixner, Sebastian Pokutta
An Algorithm-Independent Measure of Progress for Linear Constraint Propagation
Abderahmane Bedouhene, Bertrand Neveu, Gilles Trombettoni, Luc Jaulin, Stephane Le Menec
An Interval Constraint Programming Approach for Quasi Capture Tube Validation
Alexander Felfernig
An Overview of Machine Learning Techniques in Constraint Solving
Christopher Jefferson
Applying Constraint Programming to Group Theory
Ghiles Ziat, Matthieu Dien, Vincent Botbol
Automated Random Testing of Numerical Constrained Types3forum
Luc Libralesso, François Delobel, Pascal Lafourcade, Christine Solnon
Automatic Generation of Declarative Models for Differential Cryptanalysis
Trong-Hieu Tran, Cédric Pralet, Hélène Fargier
Boosting incomplete search with conflict learning
Kunal Marwaha, Stuart Hadfield
Bounds on approximating Max kXOR with quantum and classical local algorithms
Tomáš Dlask, Tomáš Werner, Simon de Givry
Bounds on Weighted CSPs Using Constraint Propagation and Super-Reparametrizations
Break
Break
BREAK / Open discussion
BREAK / Open discussion
BREAK / Panel discussion
Carlos Ansótegui, Jesus Ojeda, Eduard Torres
Building High Strength Mixed Covering Arrays with Constraints
Closing
Kyle E. C. Booth
Closing remarks
Yiwei Bai, Di Chen, Carla Gomes
CLR-DRNets: curriculum learning with restarts to solve visual combinatorial games4forum
Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manya, Djamal Habet, Kun He
Combining Clause Learning and Branch and Bound for MaxSAT
Best Paper Award
Rachid Adrdor, Lahcen Koutti
Combining Directional Arc Consistency with Asynchronous Forward Bounding algorithm
Valentin Antuori, Emmanuel Hebrard, Marie-José Huguet, Siham Essodaigui, Alain Nguyen
Combining Monte Carlo Tree Search and Depth First Search Methods for a Car Manufacturing Workshop Scheduling Problem
Mohamed Sami Cherif, Djamal Habet, Cyril Terrioux
Combining VSIDS and CHB Using Restarts in SAT
Community Discussion: Integrating modelling as a component
Johannes K. Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab
Complications for Computational Experiments from Modern Processors
Ferdinando Fioretto
Constrained-based Differential Privacy
Constraint Acquisition Challenge: Overview1forum
Amit Verma, Mark Lewis
Constraint programming to discover one-flip local optima of quadratic unconstrained binary optimization problems
COUNT CP: Learning CP problems from data
Anton Korikov, Chris Beck
Counterfactual Explanations via Inverse Constraint Programming
Tias Guns
CPMpy, a Numpy-based CP Modeling Environment
Jayanta Mandi, Rocsildes Canoy, Victor Bucarey Lopez, Tias Guns
Data Driven VRP: A Neural Network Model to learn hidden preferences for VRP
Samuel Kolb
Democratizing Constraint Satisfaction Problems through Machine Learning
Shannon Sweitzer, T. K. Satish Kumar
Differential Programming via OR Methods
Margarita Paz Castro
Doctoral Research Thesis Award
Ferdinando Fioretto
Early CAREER Research Award
Sophia Saller, Jana Koehler
Easy, adaptable and high-quality Modelling with domain-specific Constraint Patterns
Valentin Durante, Thomas Schiex, George Katsirelos
Efficient low rank convex bounds for pairwise discrete Graphical Models
Dimosthenis C. Tsouros, Kostas Stergiou
Efficient Multiple Constraint Acquisition
Andreas Niskanen, Jeremias Berg, Matti Järvisalo
Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT under Changing Weights
Jiong Yang, Kuldeep S. Meel
Engineering an Efficient PB-XOR Solver
Peter J. Stuckey, Guido Tack
Enumerated Types, Type Extensions, and Defaults for MiniZinc
Alexander Semenov, Daniil Chivilikhin, Artem Pavlenko, Ilya Otpuschennikov, Vladimir Ulyantsev, Alexey Ignatiev
Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms
Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet
Exhaustive Generation of Benzenoid Structures Sharing Common Patterns
Begüm Genç
Explanation in Constraint Satisfaction: A Survey
Hongbo Li, Minghao Yin, Zhanshan Li
Failure Based Variable Ordering Heuristics for Solving CSPs
Choiwah Chow, João Araújo, Mikolas Janota
Filtering Isomorphic Models by Invariants
Joel Maizi
Forum sandbox2forum
General Assembly
Guilherme de Azevedo Silveira
Generating magical performances with constraint programming2forum
Ilankaikone Senthooran, Matthias Klapperstueck, Gleb Belov, Tobias Czauderna, Kevin Leo, Mark Wallace, Michael Wybrow, Maria Garcia de la Banda
Human-Centred Feasibility Restoration
Fulya Trösser, Simon de Givry, George Katsirelos
Improved Acyclicity Reasoning for Bayesian Network Structure Learning with Constraint Programming
Ramin Fakhimi, Rodolfo Quintero, David Bernal, Hamidreza Validi, Illya V. Hicks, Tamás Terlaky, Luis F. Zuluaga
Improved and fully characterized QUBO reformulations of constrained combinatorial optimization problems
Hélène Verhaeghe, Roger Kameugne, Christophe Lecoutre, Pierre Schaus
Improved Filtering of Scheduling Problems using Redundant Table Constraints
Shaowei Cai, Chuan Luo, Xindi Zhang, Jian Zhang
Improving Local Search for Structured SAT Formulas via Unit Propagation based Initialization
Bohan Li, Kai Wang, Yiyuan Wang, Shaowei Cai
Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-layer Local Search
Tuukka Korhonen, Matti Järvisalo
Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters
Introduction
Torsten Schaub
Invited talk: Answer Set Programming in a Nutshell
Bart Bogaerts
Invited Talk: The IDP System: what and why?
Andrea Lodi, Defeng Liu
Learning in Local Branching6forum
Dimosthenis C. Tsouros, Kostas Stergiou
Learning Max-CSPs via Active Constraint Acquisition
Felix Ulrich-Oltean, Peter Nightingale, James Alfred Walker
Learning to Choose SAT Encodings for Pseudo-Boolean and Integer Sum Constraints
Chaitanya Joshi, Quentin Cappart, Louis-Martin Rousseau, Thomas Laurent
Learning TSP Requires Rethinking Generalization1forum
Lightning talks
Lunch break
Tengbin Wang, Liqian Chen, Taoqing Chen, Guangsheng Fan, Ji Wang
Making Rigorous Linear Programming Practical for Program Analysis6forum
Filippos Pantekis, Phillip James
Massively Parallel SAT: Revisiting 3-SAT
Marie-Louise Lackner, Felix Winter, Nysret Musliu, Christoph Mrkvicka, Daniel Walkiewicz
Minimizing cumulative batch processing time for an industrial oven scheduling problem
Peter J. Stuckey
MiniZinc challenge
Pierre Montalbano, Simon de Givry, George Katsirelos
Multiple-choice knapsack constraint in CFN
Valentin Antuori, Tom Portoleau, Louis Riviere, Emmanuel Hebrard
On How Did Turing and Singleton Arc Consistency Break the Enigma Code
Floris Doolaard, Neil Yorke-Smith
Online Learning of Deeper Variable Ordering Heuristics for Constraint Optimisation Problems
Damir Pulatov, Marie Anastacio, Lars Kotthoff, Holger Hoos
Opening the Black Box: Automated Software Analysis for Algorithm Selection
Ilankaikone Senthooran, Pierre Le Bodic, Peter J. Stuckey
Optimising Training for Service Delivery1forum
Panel discussion
Johannes K. Fichte, Markus Hecher, Valentin Roland
Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization2forum
Nils Merlin Ullmann, Tomas Balyo, Michael Klein
Parallelizing a SAT-based Product Configurator
Luis Quesada, Ken Brown
Positive and negative length-bound reachability constraints
Blair Archibald, Kyle Burns, Ciaran McCreesh, Michele Sevegnani
Practical Bigraphs via Subgraph Isomorphism1forum
Pavel Smirnov, Jeremias Berg, Matti Järvisalo
Pseudo-Boolean Optimization by Implicit Hitting Sets
Ashley Montanaro
Quantum algorithms for constraint satisfaction and optimisation problems
Lis Arufe, Miguel A. González, Riccardo Rasconi, Angelo Oddi, Ramiro Varela
Quantum circuit compilation by a genetic algorithm for QAOA
Ryan LaRose
Quantum computing for computer scientists
Questions/Results/Discussion
Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors
Elijah Pelofske, Georg Hahn, Hristo Djidjev
Reducing quantum annealing biases for solving the graph partitioning problem
Hannes Ihalainen, Jeremias Berg, Matti Järvisalo
Refined Core Relaxation for Core-Guided MaxSAT Solving
John Hooker
Research Excellence Award2forum
Review discussion
Markus Kirchweger, Stefan Szeider
SAT Modulo Symmetries for Graph Generation
Pouya Shati, Eldan Cohen, Sheila A. McIlraith
SAT-based Approach for Learning Optimal Decision Trees with Non-Binary Features
Félix Chalumeau, Ilan Coulon, Quentin Cappart, Louis-Martin Rousseau
SeaPearl: A Constraint Programming Solver Guided by Reinforcement Learning
Felix Ulrich-Oltean, Peter Nightingale, James Alfred Walker
Selecting SAT Encodings for Pseudo-Boolean and Linear Constraints: Preliminary Results
Social session
Mathieu Vavrille, Charlotte Truchet, Charles Prud'Homme
Solution sampling with random table constraints
Mohamed-Bachir Belaid, Arnaud Gotlieb, Nadjib Lazaar
Solve Optimization Problems with Unknown Constraint Networks
Mark Hodson
Solving constraint satisfaction problems on quantum hardware
Giovanni Lo Bianco, Jiachen Zhang, J. Christopher Beck
Solving quadratic optimization problems with Gaussian Boson sampling
Xiao Peng, Olivier Simonin, Christine Solnon
Solving the Non-Crossing MAPF with Constraint Programming
Théo Matricon, Marie Anastacio, Nathanaël Fijalkow, Laurent Simon, Holger H. Hoos
Statistical comparison of algorithm performance through instance selection
Claudia Archetti, Ola Jabali, Andrea Mor, Alberto Simonetto, M. Grazia Speranza
The Bi-objective Long-haul Transportation Problem on a Road Network6forum
The CAT System for the PTHG21 Challenge
Gael Glorian, Adrien Debesson, Sylvain Yvon-Paliot, Laurent Simon
The Dungeon Variations Problem Using Constraint Programming2forum
Roie Zivan, Omer Perry, Ben Rachmut, William Yeoh
The Effect of Asynchronous Execution and Message Latency on Max-sum
Eddie Armstrong, Michele Garraffa, Barry O'Sullivan, Helmut Simonis
The Hybrid Flexible Flowshop with Transportation Times
Mikolas Janota, Antonio Morgado, Jose Fragoso Santos, Vasco Manquinho
The Seesaw Algorithm: Function Optimization using Implicit Hitting Sets
Anissa Kheireddine, Etienne Renault, Souheib Baarir
Towards Better Heuristics for Solving Bounded Model Checking Problems1forum
Özgür Akgün, Alan M. Frisch, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon
Towards Reformulating Essence Specifications for Robustness
Martin Cooper, Joao Marques-Silva
Tractable Explaining
John Hooker
Tutorial in Equity Modeling2forum
Markus Iser, Tomas Balyo
Unit Propagation with Stable Watches
Robert Wille
Using SAT Solvers for Quantum Computing Design: Potential and Challenges
Benjamin Kovács, Pierre Tassel, Wolfgang Kohlenbrein, Philipp Schrott-Kostwein, Martin Gebser
Utilizing Constraint Optimization for Industrial Machine Workload Balancing5forum
Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby
Vehicle Dynamics in Pickup-and-Delivery Problems Using Electric Vehicles2forum
Helmut Simonis, Guido Tack
Visualization for Constraint Programming
Welcome
Kyle E. C. Booth
Welcome2forum
Welcome