LIPIcs, Volume 235, CP 2022

• Christine Solnon LIPIcs, Volume 235, CP 2022, Complete Volume 10.4230/LIPIcs.CP.2022
• Christine Solnon Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.CP.2022.0
• Donald E. Knuth All Questions Answered (Invited Talk) 10.4230/LIPIcs.CP.2022.1
• Kristina Asimi, Libor Barto, and Silvia Butti Fixed-Template Promise Model Checking Problems 10.4230/LIPIcs.CP.2022.2
• Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, and Ellen Vitercik Improved Sample Complexity Bounds for Branch-And-Cut 10.4230/LIPIcs.CP.2022.3
• Libor Barto and Silvia Butti Weisfeiler-Leman Invariant Promise Valued CSPs 10.4230/LIPIcs.CP.2022.4
• Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, and T. K. Satish Kumar Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data 10.4230/LIPIcs.CP.2022.5
• Nicolas Beldiceanu, Jovial Cheukam-Ngouonou, Rémi Douence, Ramiz Gindullin, and Claude-Guy Quimper Acquiring Maps of Interrelated Conjectures on Sharp Bounds 10.4230/LIPIcs.CP.2022.6
• Abdelkader Beldjilali, Pierre Montalbano, David Allouche, George Katsirelos, and Simon de Givry Parallel Hybrid Best-First Search 10.4230/LIPIcs.CP.2022.7
• Senne Berden, Mohit Kumar, Samuel Kolb, and Tias Guns Learning MAX-SAT Models from Examples Using Genetic Algorithms and Knowledge Compilation 10.4230/LIPIcs.CP.2022.8
• Christian Bessiere, Clément Carbonnel, Martin C. Cooper, and Emmanuel Hebrard Complexity of Minimum-Size Arc-Inconsistency Explanations 10.4230/LIPIcs.CP.2022.9
• Raphaël Boudreault, Vanessa Simard, Daniel Lafond, and Claude-Guy Quimper A Constraint Programming Approach to Ship Refit Project Scheduling 10.4230/LIPIcs.CP.2022.10
• Clément Carbonnel On Redundancy in Constraint Satisfaction Problems 10.4230/LIPIcs.CP.2022.11
• Mohamed Sami Cherif, Djamal Habet, and Matthieu Py From Crossing-Free Resolution to Max-SAT Resolution 10.4230/LIPIcs.CP.2022.12
• Martin C. Cooper, Arnaud Lequen, and Frédéric Maris Isomorphisms Between STRIPS Problems and Sub-Problems 10.4230/LIPIcs.CP.2022.13
• Vianney Coppé, Xavier Gillard, and Pierre Schaus Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams 10.4230/LIPIcs.CP.2022.14
• Christopher Coulombe and Claude-Guy Quimper Constraint Acquisition Based on Solution Counting 10.4230/LIPIcs.CP.2022.15
• Ágnes Cseh, Guillaume Escamocher, and Luis Quesada Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences 10.4230/LIPIcs.CP.2022.16
• Timothy Curry, Gabriel De Pace, Benjamin Fuller, Laurent Michel, and Yan (Lindsay) Sun DUELMIPs: Optimizing SDN Functionality and Security 10.4230/LIPIcs.CP.2022.17
• Nguyen Dang, Özgür Akgün, Joan Espasa, Ian Miguel, and Peter Nightingale A Framework for Generating Informative Benchmark Instances 10.4230/LIPIcs.CP.2022.18
• Augustin Delecluse, Pierre Schaus, and Pascal Van Hentenryck Sequence Variables for Routing Problems 10.4230/LIPIcs.CP.2022.19
• Jan Dreier, Sebastian Ordyniak, and Stefan Szeider CSP Beyond Tractable Constraint Languages 10.4230/LIPIcs.CP.2022.20
• Alexander Ek, Andreas Schutt, Peter J. Stuckey, and Guido Tack Explaining Propagation for Gini and Spread with Variable Mean 10.4230/LIPIcs.CP.2022.21
• Joan Espasa, Ian Miguel, and Mateu Villaret Plotting: A Planning Problem with Complex Transitions 10.4230/LIPIcs.CP.2022.22
• Hélène Fargier, Jérôme Mengin, and Nicolas Schmidt Nucleus-Satellites Systems of OMDDs for Reducing the Size of Compiled Forms 10.4230/LIPIcs.CP.2022.23
• Rebecca Gentzel, Laurent Michel, and Willem-Jan van Hoeve Heuristics for MDD Propagation in HADDOCK 10.4230/LIPIcs.CP.2022.24
• Stephan Gocht, Ciaran McCreesh, and Jakob Nordström An Auditable Constraint Programming Solver 10.4230/LIPIcs.CP.2022.25
• Marijn J. H. Heule, Anthony Karahalios, and Willem-Jan van Hoeve From Cliques to Colorings and Back Again 10.4230/LIPIcs.CP.2022.26
• Amel Hidouri, Said Jabbour, and Badran Raddaoui On the Enumeration of Frequent High Utility Itemsets: A Symbolic AI Approach 10.4230/LIPIcs.CP.2022.27
• Ruth Hoffmann, Xu Zhu, Özgür Akgün, and Miguel A. Nacenta Understanding How People Approach Constraint Modelling and Solving 10.4230/LIPIcs.CP.2022.28
• Mohit Kumar, Samuel Kolb, and Tias Guns Learning Constraint Programming Models from Data Using Generate-And-Aggregate 10.4230/LIPIcs.CP.2022.29
• Daphné Lafleur, Sarath Chandar, and Gilles Pesant Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard Constraints 10.4230/LIPIcs.CP.2022.30
• Jimmy H. M. Lee and Allen Z. Zhong Exploiting Functional Constraints in Automatic Dominance Breaking for Constraint Optimization 10.4230/LIPIcs.CP.2022.31
• Hongbo Li, Yaling Wu, Minghao Yin, and Zhanshan Li A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for Constraint Satisfaction Problems 10.4230/LIPIcs.CP.2022.32
• Jheisson López, Alejandro Arbelaez, and Laura Climent Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains 10.4230/LIPIcs.CP.2022.33
• Louis Popovic, Alain Côté, Mohamed Gaha, Franklin Nguewouo, and Quentin Cappart Scheduling the Equipment Maintenance of an Electric Power Transmission Network Using Constraint Programming 10.4230/LIPIcs.CP.2022.34
• Isaac Rudich, Quentin Cappart, and Louis-Martin Rousseau Peel-And-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams 10.4230/LIPIcs.CP.2022.35
• Mate Soos, Priyanka Golia, Sourav Chakraborty, and Kuldeep S. Meel On Quantitative Testing of Samplers 10.4230/LIPIcs.CP.2022.36
• Fulya Trösser, Simon de Givry, and George Katsirelos Structured Set Variable Domains in Bayesian Network Structure Learning 10.4230/LIPIcs.CP.2022.37
• Felix Ulrich-Oltean, Peter Nightingale, and James Alfred Walker Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints 10.4230/LIPIcs.CP.2022.38
• Jie Wang, Dingding Chen, Ziyu Chen, Xiangshuang Liu, and Junsong Gao Completeness Matters: Towards Efficient Caching in Tree-Based Synchronous Backtracking Search for DCOPs 10.4230/LIPIcs.CP.2022.39
• Ruiwei Wang and Roland H. C. Yap CNF Encodings of Binary Constraint Trees 10.4230/LIPIcs.CP.2022.40
• Felix Winter, Sebastian Meiswinkel, Nysret Musliu, and Daniel Walkiewicz Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry 10.4230/LIPIcs.CP.2022.41