Bessiere C.Hebrard E.Hnich B.Kiziltan Z.Walsh T.2023-06-162023-06-1620089.78E+110922-6389https://doi.org/10.3233/978-1-58603-891-5-475https://hdl.handle.net/20.500.14365/376018th European Conference on Artificial Intelligence, ECAI 2008 -- 21 July 2008 through 25 July 2008 -- 139245We study the CARDPATH constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CARDPATH where the slid constraint must hold always, can be used to encode a wide range of sliding sequence constraints including CARDPATH itself. We consider how to propagate SLIDE and provide a complete propagator for CARDPATH. Since propagation is NP-hard in general, we identify special cases where propagation takes polynomial time. Our experiments demonstrate that using SLIDE to encode global constraints can be as efficient and effective as specialised propagators. © 2008 The authors and IOS Press. All rights reserved.eninfo:eu-repo/semantics/closedAccessPolynomial approximationGlobal constraintsNP-hardPolynomial-timeEncoding (symbols)Conference Object10.3233/978-1-58603-891-5-4752-s2.0-85052003302