Constraint programming (CP) is a powerful solving paradigm that is based on inference and search control algorithms and suitable for arbitrary/various NP-hard combinatorial problems beyond linearity. The flexibility of constraints – the working machines of a CP solver – allow a wide range of problems to be solved by constraint programming solvers… (More)