Abstract
The Sequence constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the Sequence constraint, some of which do not hinder propagation. We prove that, down a branch of a search tree, domain consistency can be enforced on the Sequence constraint in just O(n 2 logn) time. This improves upon the previous bound of O(n 3) for each call down the tree. We also consider a generalization of the Sequence constraint – the Multiple Sequence constraint. Our experiments suggest that, on very large and tight problems, domain consistency algorithms are best. However, on smaller or looser problems, much simpler encodings are better, even though these encodings hinder propagation. When there are multiple Sequence constraints, a more expensive propagator shows promise.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Quimper, C.G., Walsh, T.: Global grammar constraints. [11], pp. 751–755
Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Mathematical and Computer Modelling 12, 97–123 (1994)
Debruyne, R., Bessière, C.: Some practicable filtering techniques for the constraint satisfaction problem. In: 15th Int. Joint Conf. on Artificial Intelligence (IJCAI 1997), pp. 412–417. Morgan Kaufmann, San Francisco (1997)
Bessière, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: The SLIDE-meta constraint. Technical report (2007)
van Hoeve, W.J., Pesant, G., Rousseau, L.M., Sabharwal, A.: Revisiting the Sequence constraint. [11], pp. 620–634
Régin, J.C., Puget, J.F.: A filtering algorithm for global sequencing constraints. In: Smolka, G. (ed.) Principles and Practice of Constraint Programming - CP 1997. LNCS, vol. 1330, pp. 32–46. Springer, Heidelberg (1997)
Beldiceanu, N., Carlsson, M.: Revisiting the cardinality operator and introducing the cardinality-path constraint family. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, pp. 59–73. Springer, Heidelberg (2001)
Régin, J.C.: Combination of Among and Cardinality constraints. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 288–303. Springer, Heidelberg (2005)
Cotton, S., Maler, O.: Fast and flexible difference constraint propagation for DPLL(T). In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 170–183. Springer, Heidelberg (2006)
Benhamou, F. (ed.): CP 2006. LNCS, vol. 4204. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brand, S., Narodytska, N., Quimper, CG., Stuckey, P., Walsh, T. (2007). Encodings of the Sequence Constraint. In: Bessière, C. (eds) Principles and Practice of Constraint Programming – CP 2007. CP 2007. Lecture Notes in Computer Science, vol 4741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74970-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-74970-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74969-1
Online ISBN: 978-3-540-74970-7
eBook Packages: Computer ScienceComputer Science (R0)