Table of Contents

• Constraint Acquisition Based on Solution CountingChristopher Coulombe, Claude-Guy Quimper. [doi]
• Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered DomainsJheisson López, Alejandro Arbelaez, Laura Climent. [doi]
• Selecting SAT Encodings for Pseudo-Boolean and Linear Integer ConstraintsFelix Ulrich-Oltean, Peter Nightingale, James Alfred Walker. [doi]
• Nucleus-Satellites Systems of OMDDs for Reducing the Size of Compiled FormsHélène Fargier, Jérôme Mengin, Nicolas Schmidt. [doi]
• Exploiting Functional Constraints in Automatic Dominance Breaking for Constraint OptimizationJimmy H. M. Lee, Allen Z. Zhong. [doi]
• Weisfeiler-Leman Invariant Promise Valued CSPsLibor Barto, Silvia Butti. [doi]
• An Auditable Constraint Programming SolverStephan Gocht, Ciaran McCreesh, Jakob Nordström. [doi]
• Plotting: A Planning Problem with Complex TransitionsJoan Espasa, Ian Miguel, Mateu Villaret. [doi]
• Isomorphisms Between STRIPS Problems and Sub-ProblemsMartin C. Cooper, Arnaud Lequen, Frédéric Maris. [doi]
• Completeness Matters: Towards Efficient Caching in Tree-Based Synchronous Backtracking Search for DCOPsJie Wang, Dingding Chen, Ziyu Chen, Xiang-Shuang Liu, Junsong Gao. [doi]
• On Quantitative Testing of SamplersMate Soos, Priyanka Golia, Sourav Chakraborty 0001, Kuldeep S. Meel. [doi]
• Learning MAX-SAT Models from Examples Using Genetic Algorithms and Knowledge CompilationSenne Berden, Mohit Kumar 0003, Samuel Kolb, Tias Guns. [doi]
• All Questions Answered (Invited Talk)Donald E. Knuth. [doi]
• Complexity of Minimum-Size Arc-Inconsistency ExplanationsChristian Bessiere, Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard. [doi]
• Explaining Propagation for Gini and Spread with Variable MeanAlexander Ek, Andreas Schutt, Peter J. Stuckey, Guido Tack. [doi]
• Heuristics for MDD Propagation in HADDOCKRebecca Gentzel, Laurent Michel, Willem Jan van Hoeve. [doi]
• Acquiring Maps of Interrelated Conjectures on Sharp BoundsNicolas Beldiceanu, Jovial Cheukam-Ngouonou, Rémi Douence, Ramiz Gindullin, Claude-Guy Quimper. [doi]
• A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for Constraint Satisfaction ProblemsHongbo Li, Yaling Wu, Minghao Yin, Zhanshan Li. [doi]
• Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical DataChaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, T. K. Satish Kumar. [doi]
• Scheduling the Equipment Maintenance of an Electric Power Transmission Network Using Constraint ProgrammingLouis Popovic, Alain Côté, Mohamed Gaha, Franklin Nguewouo, Quentin Cappart. [doi]
• CSP Beyond Tractable Constraint LanguagesJan Dreier, Sebastian Ordyniak, Stefan Szeider. [doi]
• Fixed-Template Promise Model Checking ProblemsKristina Asimi, Libor Barto, Silvia Butti. [doi]
• Solving the Constrained Single-Row Facility Layout Problem with Decision DiagramsVianney Coppé, Xavier Gillard, Pierre Schaus. [doi]
• DUELMIPs: Optimizing SDN Functionality and SecurityTimothy Curry, Gabriel De Pace, Benjamin Fuller 0001, Laurent Michel, Yan Lindsay Sun. [doi]
• Parallel Hybrid Best-First SearchAbdelkader Beldjilali, Pierre Montalbano, David Allouche, George Katsirelos, Simon de Givry. [doi]
• Structured Set Variable Domains in Bayesian Network Structure LearningFulya Trösser, Simon de Givry, George Katsirelos. [doi]
• Understanding How People Approach Constraint Modelling and SolvingRuth Hoffmann, Xu Zhu, Özgür Akgün, Miguel A. Nacenta. [doi]
• On Redundancy in Constraint Satisfaction ProblemsClément Carbonnel. [doi]
• Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard ConstraintsDaphné Lafleur, Sarath Chandar, Gilles Pesant. [doi]
• Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic PreferencesÁgnes Cseh, Guillaume Escamocher, Luis Quesada 0001. [doi]
• From Crossing-Free Resolution to Max-SAT ResolutionMohamed Sami Cherif, Djamal Habet, Matthieu Py. [doi]
• A Framework for Generating Informative Benchmark InstancesNguyen Dang 0001, Özgür Akgün, Joan Espasa, Ian Miguel, Peter Nightingale. [doi]
• A Constraint Programming Approach to Ship Refit Project SchedulingRaphaël Boudreault, Vanessa Simard, Daniel Lafond, Claude-Guy Quimper. [doi]
• From Cliques to Colorings and Back AgainMarijn J. H. Heule, Anthony Karahalios, Willem Jan van Hoeve. [doi]
• On the Enumeration of Frequent High Utility Itemsets: A Symbolic AI ApproachAmel Hidouri, Saïd Jabbour, Badran Raddaoui. [doi]
• Improved Sample Complexity Bounds for Branch-And-CutMaria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik. [doi]
• Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural IndustryFelix Winter, Sebastian Meiswinkel, Nysret Musliu, Daniel Walkiewicz. [doi]
• Learning Constraint Programming Models from Data Using Generate-And-AggregateMohit Kumar 0003, Samuel Kolb, Tias Guns. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• CNF Encodings of Binary Constraint TreesRuiwei Wang, Roland H. C. Yap. [doi]
• Peel-And-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision DiagramsIsaac Rudich, Quentin Cappart, Louis-Martin Rousseau. [doi]
• Sequence Variables for Routing ProblemsAugustin Delecluse, Pierre Schaus, Pascal Van Hentenryck. [doi]