Proceedings

The proceedings are available at LIPICS.

Accepted papers

  • Hongbo Li, Minghao Yin and Zhanshan Li. "Failure Based Variable Ordering Heuristics for Solving CSPs".
  • Chaitanya K. Joshi, Quentin Cappart, Louis-Martin Rousseau and Thomas Laurent. "Learning TSP Requires Rethinking Generalization".
  • Guilherme de Azevedo. "Generating magical performances with constraint programming".
  • Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manya, Djamal Habet and Kun He. "Combining Clause Learning and Branch and Bound for MaxSAT".
  • Martin C. Cooper and Joao Marques-Silva. "Tractable Explaining".
  • Xiangshuang Liu, Ziyu Chen, Dingding Chen and Junsong Gao. "A Bound-Independent Pruning Technique to Speeding Up Tree-based Complete Search Algorithms for Distributed Constraint Optimization Problems".
  • Adrien Debesson, Gael Glorian, Laurent Simon and Sylvain Yvon-Paliot. "The Dungeon Variations Problem Using Constraint Programming".
  • Markus Iser and Tomas Balyo. "Unit Propagation with Stable Watches".
  • Tomáš Dlask, Tomáš Werner and Simon de Givry. "Bounds on Weighted CSPs Using Constraint Propagation and Super-Reparametrizations".
  • Théo Matricon, Marie Anastacio, Nathanaël Fijalkow, Laurent Simon and Holger H. Hoos. "Statistical comparison of algorithm performance through instance selection".
  • Bohan Li, Kai Wang, Yiyuan Wang and Shaowei Cai. "Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-layer Local Search".
  • Anissa Kheireddine, Etienne Renault and Souheib Baarir. "Towards Better Heuristics for Solving Bounded Model Checking Problems".
  • Benjamin Kovács, Martin Gebser, Philipp Schrott-Kostwein, Pierre Tassel and Wolfgang Kohlenbrein. "Utilizing Constraint Optimization for Industrial Machine Workload Balancing".
  • Ágnes Cseh, Guillaume Escamocher, Begüm Genç and Luis Quesada. "A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences".
  • Roie Zivan, Omer Perry, Ben Rachmut and William Yeoh. "The Effect of Asynchronous Execution and Message Latency on Max-sum".
  • Nils Merlin Ullmann, Tomas Balyo and Michael Klein. "Parallelizing a SAT-based Product Configurator".
  • Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux and Adrien Varet. "Exhaustive Generation of Benzenoid Structures Sharing Common Patterns".
  • Mohamed Sami Cherif, Djamal Habet and Cyril Terrioux. "Combining VSIDS and CHB Using Restarts in SAT".
  • Luc Libralesso, François Delobel, Pascal Lafourcade and Christine Solnon. "Automatic Generation of Declarative Models for Differential Cryptanalysis".
  • Xiao Peng, Christine Solnon, Olivier Simonin. "Solving the Non-Crossing MAPF with Constraint Programming".
  • Nicolas Isoartand and Jean-Charles Regin. "A linear time algorithm for the k-cutset constraint".
  • Tengbin Wang, Liqian Chen, Taoqing Chen, Guangsheng Fan and Ji Wang. "Making Rigorous Linear Programming Practical for Program Analysis".
  • Jayanta Mandi, Rocsildes Canoy, Victor Bucarey Lopez and Tias Guns. "Data Driven VRP: A Neural Network Model to learn hidden preferences for VRP".
  • Ilankaikone Senthooran, Pierre Le Bodic, and Peter J. Stuckey. "Optimising Training for Service Delivery".
  • Peter Jonsson, Victor Lagerkvist and Sebastian Ordyniak. "Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors".
  • Johannes K. Fichte, Markus Hecher and Valentin Roland. "Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization".
  • Luis Quesada and Kenneth N. Brown. "Positive and negative length-bound reachability constraints".
  • Shaowei Cai, Chuan Luo, Zhang Xindi and Jian Zhang. "Improving Local Search for Structured SAT Formulas via Unit Propagation based Initialization".
  • Saman Ahmadi, Guido Tack, Daniel Harabor and Philip Kilby. "Vehicle Dynamics in Pickup-and-Delivery Problems Using Electric Vehicles".
  • Jiong Yang and Kuldeep S. Meel. "Engineering an Efficient PB-XOR Solver".
  • Boro Sofranac, Ambros Gleixner and Sebastian Pokutta. "An Algorithm-Independent Measure of Progress for Linear Constraint Propagation".
  • Ghiles Ziat, Matthieu Dien and Vincent Botbol. "Automated Random Testing of Numerical Constrained Types".
  • Tuukka Korhonen and Matti Järvisalo. "Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters".
  • Mathieu Vavrille, Charles Prud'Homme and Charlotte Truchet. "Solution sampling with random table constraints".
  • Hannes Ihalainen, Jeremias Berg and Matti Järvisalo. "Refined Core Relaxation for Core-Guided MaxSAT Solving".
  • Pavel Smirnov, Jeremias Berg and Matti Järvisalo. "Pseudo-Boolean Optimization by Implicit Hitting Sets".
  • Alexander Semenov, Daniil Chivilikhin, Artem Pavlenko, Ilya Otpuschennikov, Vladimir Ulyantsev and Alexey Ignatiev. "Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms".
  • Blair Archibald, Kyle Burns, Ciaran McCreesh and Michele Sevegnani. "Practical Bigraphs via Subgraph Isomorphism".
  • Markus Kirchweger and Stefan Szeider. "SAT Modulo Symmetries for Graph Generation".
  • Eddie Armstrong, Michele Garraffa, Barry O'Sullivan and Helmut Simonis. "The Hybrid Flexible Flowshop with Transportation Times".
  • Carlos Ansótegui, Jesus Ojeda and Eduard Torres. "Building High Strength Mixed Covering Arrays with Constraints".
  • Andreas Niskanen, Jeremias Berg and Matti Järvisalo. "Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT under Changing Weights".
  • João Araújo, Choiwah Chow and Mikoláš Janota. "Filtering Isomorphic Models by Invariants".
  • C. Tsouros and Kostas Stergiou. "Learning Max-CSPs via Active Constraint Acqusition".
  • Shannon Sweitzer and T. K. Satish Kumar. "Differential Programming via OR Methods".
  • Nicolas Isoart and Jean-Charles Regin. "A k-opt based constraint for the TSP".
  • Ilankaikone Senthooran, Gleb Belov, Kevin Leo, Michael Wybrow, Matthias Klapperstueck, Tobias Czauderna, Mark Wallace and Maria Garcia De La Banda. "Human-Centred Feasibility Restoration".
  • Anton Korikov and Christopher Beck. "Counterfactual Explanations via Inverse Constraint Programming".
  • Pouya Shati, Eldan Cohen and Sheila McIlraith. "SAT-based Approach for Learning Optimal Decision Trees with Non-Binary Features".
  • Valentin Antuori, Tom Portoleau, Louis Riviere and Emmanuel Hebrard. "On How Did Turing and Singleton Arc Consistency Break the Enigma Code".
  • Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz and Felix Winter. "Minimizing cumulative batch processing time for an industrial oven scheduling problem".
  • Cristian Galleguillos, Zeynep Kiziltan and Ricardo Soto. "A Job Dispatcher for Large and Heterogeneous HPC Systems Running Modern Applications".
  • Abderahmane Bedouhene, Bertrand Neveu, Gilles Trombettoni, Luc Jaulin and Stephane Le Menec. "An Interval Constraint Programming Approach for Quasi Capture Tube Validation".
  • Valentin Antuori, Emmanuel Hebrard, Marie-José Huguet, Siham Essodaigui and Alain Nguyen. "Combining Monte Carlo Tree Search and Depth First Search Methods for a Car Manufacturing Workshop Scheduling Problem".
  • Johannes K. Fichte, Markus Hecher, Ciaran McCreesh and Anas Shahab. "Complications for Computational Experiments from Modern Processors".
  • Mikolas Janota, Antonio Morgado, Jose Fragoso Santos and Vasco Manquinho. "The Seesaw Algorithm: Function Optimization using Implicit Hitting Sets".
  • Yiwei Bai, Di Chen and Carla P. Gomes. "CLR-DRNets: curriculum learning with restarts to1solve visual combinatorial games".