Abstract
The period constraint restricts the smallest period of a sequence of domain variables to be equal to a given domain variable. This paper first provides propositions for evaluating the feasible values of the smallest period of a sequence of domain variables. Then, it gives propositions for pruning the variables of the sequence in order to achieve one out of several possible smallest periods. The generalisation of the period constraint to the case where the equality between two domain variables is replaced by any condition is also considered.
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.
References
Beldiceanu, N.: Global Constraints as Graph Properties on Structured Network of Elementary Constraints of the Same Type. SICS Technical Report T2000/01 (2000)
Bockmayr, A., Pisaruk, N., Aggoun, A.: Network Flow Problems in Constraint Programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 196–210. Springer, Heidelberg (2001)
Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, New York (1994)
Crochemore, M., Hancart, C., Lecroq, T.: Algorithmique du texte. Vuibert, Paris (2001) (in French)
Czumaj, A., Gasieniec, L.: On the Complexity of Determining the Period of a String. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 412–422. Springer, Heidelberg (2000)
Golden, K., Pang, W.: Constraint Reasoning over Strings. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 377–391. Springer, Heidelberg (2003)
Hikita, T., Goto, E.: An O(N) algorithm for finding periodicity of a sequence using hash coding. Information Processing Letters 6(2), 69–71 (1977)
Pesant, G.: A Filtering Algorithm for the Stretch Constraint. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 183–195. Springer, Heidelberg (2001)
Pesant, G.: A Regular Language Membership Constraint for Sequences of Variables. In: 2nd Interntional Workshop on Modelling and Reformulating Constraint Satisfaction Problems, Principles and Practice of Constraint Programming - CP 2003, Kinsale, Ireland, September 29-October 3, Proceedings, pp. 110–119 (2003)
Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, Implementation and Evaluation of the Constraint Language cc(FD). In: Podelski, A. (ed.) Constraint Programming: Basics and Trends. LNCS, vol. 910, Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beldiceanu, N., Poder, E. (2004). The period Constraint. In: Demoen, B., Lifschitz, V. (eds) Logic Programming. ICLP 2004. Lecture Notes in Computer Science, vol 3132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27775-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-27775-0_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22671-0
Online ISBN: 978-3-540-27775-0
eBook Packages: Springer Book Archive