Bessiere C.Hebrard E.Hnich B.Kiziltan Z.Quimper C.-G.Walsh T.2023-06-162023-06-162007354073579897835407357930302-9743https://doi.org/10.1007/978-3-540-73580-9_9https://hdl.handle.net/20.500.14365/3393Google, Inc.;The Association for the Advancement of Artificial Intelligence;The Pacific Institute for the Mathematical Sciences;The Palo Alto Research Center7th International Symposium on Abstraction, Reformulation, and Approximation , SARA 2007 -- 18 July 2007 through 21 July 2007 -- Whistler -- 69962Global constraints are useful for modelling and reasoning about real-world combinatorial problems. Unfortunately, developing propagation algorithms to reason about global constraints efficiently and effectively is usually a difficult and complex process. In this paper, we show that reformulation may be helpful in building such propagators. We consider both hard and soft forms of two powerful global constraints, SLIDE and REGULAR. These global constraints are useful to represent a wide range of problems like rostering and scheduling where we have a sequence of decision variables and some constraint that holds along the sequence. We show that the different forms of SLIDE and REGULAR can all be reformulated as each other. We also show that reformulation is an effective method to incorporate such global constraints within an existing constraint toolkit. Finally, this study provides insight into the close relationship between these two important global constraints. © Springer-Verlag Berlin Heidelberg 2007.eninfo:eu-repo/semantics/openAccessCase based reasoningDecision theoryMathematical modelsSchedulingCombinatorial problemsGlobal constraintsReformulationREGULAR constraintsConstraint theoryConference Object10.1007/978-3-540-73580-9_92-s2.0-34548081260