Bessiere, ChristianHebrard, EmmanuelHnich, BrahimKiziltan, ZeynepWalsh, Toby2023-06-162023-06-1620090004-37021872-7921https://doi.org/10.1016/j.artint.2009.03.001https://hdl.handle.net/20.500.14365/1072We propose RANGE and ROOTS which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for these two patterns. Counting and occurrence constraints specified using these patterns thus directly inherit a propagation algorithm. To illustrate the capabilities of the RANGE and ROOTS constraints, we specify a number of global constraints taken from the literature. Preliminary experiments demonstrate that propagating counting and occurrence constraints using these two patterns leads to a small loss in performance when compared to specialised global constraints and is competitive with alternative decompositions using elementary constraints. (C) 2009 Elsevier B.V. All rights reserved.eninfo:eu-repo/semantics/openAccessConstraint programmingConstraint satisfactionGlobal constraintsOpen global constraintsDecompositionsAlgorithmsArticle10.1016/j.artint.2009.03.0012-s2.0-67349112087