Principles and Practice of Constraint Programming: 25th International Conference, CP 2019, Stamford, CT, USA, September 30 October 4, 2019, Proceedi [Paperback]

The 44 full papers presented in this volume were carefully reviewed and selected from 118 submissions. They deal with all aspects of computing with constraints including theory, algorithms, environments, languages, models, systems, and applications such as decision making, resource allocation, scheduling, configuration, and planning. The papers were organized according to the following topics/tracks: technical track; application track; multi-agent and parallel CP track; testing and verification track; CP and data science track; computational sustainability; and CP and life sciences track.

Technical Track.- Instance Generation via Generator Instances.- Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints.- Exploring Declarative Local-Search Neighbourhoods with Constraint Programming.- Vehicle routing by learning from historical solutions.- On Symbolic Approaches for Computing the Matrix Permanent.- Towards the Characterization of Max-Resolution Transformations of UCSs by UP-Resilience.- Logic-Based Benders Decomposition for Super Solutions: an Application to the Kidney Exchange Problem.- Exploiting Glue Clauses to Design Effective CDCL Branching Heuristics.- Industrial Size Job-Shop Scheduling tackled by Present-Day CP Solvers.- Dual Hashing-based Algorithms for Discrete Integration.- Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search.- A Join-Based Hybrid Parameter for Constraint Satisfaction.- An Incremental SAT-BasedApproach to the Graph Colouring Problem.- Constraint-based Techniques in Stochastic Local Search MaxSAT Solving.- Trimming Graphs Using Clausal Proof Optimization.- Imprl#