Abstract
We revisit the SeqBin constraint [1]. This meta-constraint subsumes a number of important global constraints like Change [2], Smooth [3] and IncreasingNValue [4]. We show that the previously proposed filtering algorithm for SeqBin has two drawbacks even under strong restrictions: it does not detect bounds disentailment and it is not idempotent. We identify the cause for these problems, and propose a new propagator that overcomes both issues. Our algorithm is based on a connection to the problem of finding a path of a given cost in a restricted n-partite graph. Our propagator enforces domain consistency in O(nd2) and, for special cases of SeqBin that include Change, Smooth and IncreasingNValue in O(nd) time.
NICTA is funded by the Australian Government’s Department of Broadband, Communications, and the Digital Economy and the Australian Research Council. This work was partially funded by the “Agence nationale de la Recherche”, reference ANR-10-BLA-0214.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Petit, T., Beldiceanu, N., Lorca, X.: A generalized arc-consistency algorithm for a class of counting constraints. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 643–648 (2011)
Cosytec: CHIP Reference manual (1997)
Beldiceanu, N., Carlsson, M., Rampon, J.X.: Global constraint catalog. Technical report 2005-08, Swedish Institute of Computer Science (2010)
Beldiceanu, N., Hermenier, F., Lorca, X., Petit, T.: The Increasing Nvalue Constraint. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 25–39. Springer, Heidelberg (2010)
Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: Slide: A useful special case of the cardpath constraint. In: Proceedings of the 18th European Conference on Artificial Intelligence, pp. 475–479 (2008)
Dechter, R., van Beek, P.: Local and Global Relational Consistency. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 240–257. Springer, Heidelberg (1995)
Pesant, G.: A Regular Language Membership Constraint for Finite Sequences of Variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 482–495. Springer, Heidelberg (2004)
Beldiceanu, N., Carlsson, M., Petit, T.: Deriving Filtering Algorithms from Constraint Checkers. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 107–122. Springer, Heidelberg (2004)
Demassey, S., Pesant, G., Rousseau, L.M.: A cost-regular based hybrid column generation approach. Constraints 11(4), 315–333 (2006)
Petit, T., Beldiceanu, N., Lorca, X.: A generalized arc-consistency algorithm for a class of counting constraints: Revised edition that incorporates one correction. CoRR abs/1110.4719 (2011)
Katsirelos, G., Narodytska, N., Walsh, T.: The SeqBin Constraint Revisited (2012), Available from CoRR http://arxiv.org/abs/1207.1811
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katsirelos, G., Narodytska, N., Walsh, T. (2012). The SeqBin Constraint Revisited. In: Milano, M. (eds) Principles and Practice of Constraint Programming. CP 2012. Lecture Notes in Computer Science, vol 7514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33558-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-33558-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33557-0
Online ISBN: 978-3-642-33558-7
eBook Packages: Computer ScienceComputer Science (R0)