Abstract
This paper describes a global constraint on a fixed-length sequence of finite-domain variables requiring that the corresponding sequence of values taken by these variables belong to a given regular language, thereby generalizing some other known global constraints. We describe and analyze a filtering algorithm achieving generalized arc consistency for this constraint. Some comparative empirical results are also given.
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
Amilhastre, J., Fargier, H., Marquis, P.: Consistency Restoration and Explanations in Dynamic CSPs – Application to Configuration. Artificial Intelligence 135, 199–234 (2002)
Carlsson, M., Beldiceanu, N.: Revisiting the Lexicographic Ordering Constraint. Technical Report T2002:17, SICS, 13 p (2002)
Chang, C., Paige, R.: From Regular Expressions to DFA’s Using Compressed NFA’s. Theoretical Computer Science 178, 1–36 (1997)
The Sequence Global Constraint of CHIP. Technical Report COSY/SEQ/032, COSYTEC, Orsay, France (1999)
Colmerauer, A.: An Introduction to PROLOG III. Communications of the ACM 33(7), 69–90 (1990)
Golden, K., Pang, W.: Constraint Reasoning over Strings. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 377–391. Springer, Heidelberg (2003)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
ILOG S.A., Gentilly, France. ILOG Solver Reference Manual, version 4.4 (1999)
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: Proc. Second International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, Principles and Practice of Constraint Programming (CP 2003), Kinsale, Ireland, pp. 110–119 (2003)
Rajasekar, A.: Applications in Constraint Logic Programming with Strings. In: Borning, A. (ed.) PPCP 1994. LNCS, vol. 874, pp. 109–122. Springer, Heidelberg (1994)
Trick, M.A.: A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints. Annals of Operations Research 118, 73–84 (2003)
Vempaty, N.R.: Solving Constraint Satisfaction Problems Using Finite State Automata. In: Proc. National Conference on Artificial Intelligence (AAAI 1992), pp. 453–458. AAAI Press, Menlo Park (1992)
Walinsky, C.: CLP(Σ_): Constraint Logic Programming with Regular Sets. In: Proceedings of the Sixth International Conference on Logic Programming, Lisbon, Portugal, pp. 181–196. MIT Press, Cambridge (1989)
Watson, B.W.: A taxonomy of finite automata minimization algorithms. Technical Report Computing Science Note 93/44, Eindhoven University of Technology, The Netherlands (1993)
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
Pesant, G. (2004). A Regular Language Membership Constraint for Finite Sequences of Variables. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive