Table of Contents

• Probabilistic Inference by Projected Weighted Model Counting on Horn ClausesAlexandre Dubray, Pierre Schaus, Siegfried Nijssen. [doi]
• Assembly Line Preliminary Design Optimization for an AircraftStéphanie Roussel 0001, Thomas Polacsek, Anouck Chan. [doi]
• A Tale of Two Cities: Teaching CP with Story-Telling (Invited Talk)Jimmy H. M. Lee. [doi]
• An Efficient Constraint Programming Approach to Preemptive Job Shop SchedulingCarla Juvin, Emmanuel Hebrard, Laurent Houssin, Pierre Lopez. [doi]
• Learning a Generic Value-Selection Heuristic Inside a Constraint Programming SolverTom Marty, Tristan François, Pierre Tessier, Louis Gautier, Louis-Martin Rousseau, Quentin Cappart. [doi]
• Optimization Models for Pickup-And-Delivery Problems with Reconfigurable CapacitiesArnoosh Golestanian, Giovanni Lo Bianco, Chengyu Tao, J. Christopher Beck. [doi]
• FastMapSVM for Predicting CSP SatisfiabilityKexin Zheng, Ang Li, Han Zhang, T. K. Satish Kumar. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Preprocessing in SAT-Based Multi-Objective Combinatorial OptimizationChristoph Jabs, Jeremias Berg, Hannes Ihalainen, Matti Järvisalo. [doi]
• Partially Preemptive Multi Skill/Mode Resource-Constrained Project Scheduling with Generalized Precedence Relations and CalendarsGuillaume Povéda, Nahum Álvarez, Christian Artigues. [doi]
• Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set ProgrammingVan-Giang Trinh, Belaid Benhamou, Sylvain Soliman. [doi]
• Simplifying Step-Wise Explanation SequencesIgnace Bleukx, Jo Devriendt, Emilio Gamba, Bart Bogaerts 0001, Tias Guns. [doi]
• Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean ReasoningGioni Mexi, Timo Berthold, Ambros M. Gleixner, Jakob Nordström. [doi]
• Boosting Decision Diagram-Based Branch-And-Bound by Pre-Solving with Aggregate Dynamic ProgrammingVianney Coppé, Xavier Gillard, Pierre Schaus. [doi]
• Constraint Programming with External Worst-Case Traversal Time AnalysisPierre Talbot, Tingting Hu, Nicolas Navet. [doi]
• CP Solver Design for Maximum CPU Utilization (Invited Talk)Petr Vilím. [doi]
• Guiding Backtrack Search by Tracking Variables During Constraint PropagationGilles Audemard, Christophe Lecoutre, Charles Prud'homme. [doi]
• Partitioning a Map into Homogeneous Contiguous Regions: A Branch-And-Bound Approach Using Decision Diagrams (Short Paper)Nicolas Golenvaux, Xavier Gillard, Siegfried Nijssen, Pierre Schaus. [doi]
• Searching for Smallest Universal Graphs and Tournaments with SATTianwei Zhang, Stefan Szeider. [doi]
• Improving Local Search for Pseudo Boolean Optimization by Fragile Scoring Function and Deep OptimizationWenbo Zhou, Yujiao Zhao, Yiyuan Wang, Shaowei Cai 0001, Shimao Wang, Xinyu Wang, Minghao Yin. [doi]
• Exploiting Configurations of MaxSAT SolversJosep Alòs, Carlos Ansótegui, Josep M. Salvia, Eduard Torres. [doi]
• From Formal Boosted Tree Explanations to Interpretable Rule SetsJinqiang Yu, Alexey Ignatiev, Peter J. Stuckey. [doi]
• The CP-SAT-LP Solver (Invited Talk)Laurent Perron, Frédéric Didier, Steven Gay. [doi]
• Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and DensityRoger Kameugne, Sévérine Betmbe Fetgo, Thierry Noulamo, Clémentin Tayou Djamégni. [doi]
• The p-Dispersion Problem with Distance ConstraintsNikolaos Ploskas, Kostas Stergiou 0001, Dimosthenis C. Tsouros. [doi]
• Constraint Model for the Satellite Image Mosaic Selection Problem (Short Paper)Manuel Combarro Simón, Pierre Talbot, Grégoire Danoy, Jedrzej Musial, Mohammed Alswaitti, Pascal Bouvry. [doi]
• Proof Logging for Smart Extensional ConstraintsMatthew J. McIlree, Ciaran McCreesh. [doi]
• Binary Constraint Trees and Structured DecomposabilityPetr Kucera. [doi]
• SAT-Based Learning of Compact Binary Decision Diagrams for ClassificationPouya Shati, Eldan Cohen, Sheila A. McIlraith. [doi]
• Incremental Constrained Clustering by Minimal Weighted ModificationAymeric Beauchamp, Thi-Bich-Hanh Dao, Samir Loudni, Christel Vrain. [doi]
• Towards More Efficient Local Search for Pseudo-Boolean OptimizationYi Chu, Shaowei Cai 0001, Chuan Luo, Zhendong Lei, Cong Peng 0004. [doi]
• Constraint Programming Models for Depth-Optimal Qubit Assignment and SWAP-Based Routing (Short Paper)Kyle E. C. Booth. [doi]
• Large Neighborhood Beam Search for Domain-Independent Dynamic ProgrammingRyo Kuroiwa 0002, J. Christopher Beck. [doi]
• Optimization of Short-Term Underground Mine Planning Using Constraint ProgrammingYounes Aalian, Gilles Pesant, Michel Gamache. [doi]
• A CP Approach for the Liner Shipping Network Design ProblemYousra El Ghazi, Djamal Habet, Cyril Terrioux. [doi]
• Symmetries for Cube-And-Conquer in Finite Model FindingJoão Araújo 0002, Choiwah Chow, Mikolás Janota. [doi]
• Beyond Optimal Solutions for Real-World Problems (Invited Talk)Maria Garcia de la Banda. [doi]
• MDD Archive for Boosting the Pareto ConstraintSteve Malalel, Arnaud Malapert, Marie Pelleau, Jean-Charles Régin. [doi]
• Coupling CP with Deep Learning for Molecular Design and SARS-CoV2 Variants Exploration (Invited Talk)Thomas Schiex. [doi]
• Exploring Hydrogen Supply/Demand Networks: Modeller and Domain Expert ViewsMatthias Klapperstueck, Frits de Nijs, Ilankaikone Senthooran, Jack Lee-Kopij, Maria Garcia de la Banda, Michael Wybrow. [doi]
• Proven Optimally-Balanced Latin Rectangles with SAT (Short Paper)Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider. [doi]
• Constraint Programming to Improve Hub Utilization in Autonomous Transfer Hub Networks (Short Paper)ChungJae Lee, Wirattawut Boonbandansook, Vahid Eghbal Akhlaghi, Kevin Dalmeijer, Pascal Van Hentenryck. [doi]
• Distribution Optimization in Constraint ProgrammingGuillaume Perez, Gaël Glorian, Wijnand Suijlen, Arnaud Lallouet. [doi]
• Enumerative Level-2 Solution Counting for Quantified Boolean Formulas (Short Paper)Andreas Plank, Sibylle Möhle, Martina Seidl. [doi]
• Using Canonical Codes to Efficiently Solve the Benzenoid Generation Problem with Constraint ProgrammingXiao Peng, Christine Solnon. [doi]
• Guided Bottom-Up Interactive Constraint AcquisitionDimosthenis C. Tsouros, Senne Berden, Tias Guns. [doi]
• Predict-Then-Optimise Strategies for Water Flow Control (Short Paper)Vincent Barbosa Vaz, James Bailey 0001, Christopher Leckie, Peter J. Stuckey. [doi]
• Fast Matrix Multiplication Without Tears: A Constraint Programming ApproachArnaud Deza, Chang Liu, Pashootan Vaezipoor, Elias B. Khalil. [doi]
• Addressing Problem Drift in UNHCR Fund AllocationSameela Suharshani Wijesundara, Maria Garcia de la Banda, Guido Tack. [doi]
• A New Approach to Finding 2 x n Partially Spatially Balanced Latin Rectangles (Short Paper)Renee Mirka, Laura Greenstreet, Marc Grimson, Carla P. Gomes. [doi]