Abstract
We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two case studies of constraints on vectors of variables. This has enabled us to derive an incremental filtering algorithm that runs in O(n) plus amortized O(1) time per propagation event for the lexicographic ordering constraint over two vectors of size n, and an O(nmd) time filtering algorithm for a chain of m-1 such constraints, where d is the cost of certain domain operations. Both algorithms maintain hyperarc consistency. Our approach can be seen as a first step towards a methodology for semi-automatic development of filtering algorithms.
Chapter PDF
References
Régin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proc. of the National Conference on Artificial Intelligence (AAAI 1994), pp. 362–367 (1994)
Régin, J.-C.: Generalized arc consistency for global cardinality constraint. In: Proc. of the National Conference on Artificial Intelligence (AAAI 1994), pp. 209–215 (1996)
Baptiste, P., LePape, C., Nuijten, W.: Constraint-Based Scheduling. Kluwer Academic Publishers, Dordrecht (2001)
Tucker, A.: Applied Combinatorics, 4th edn. John Wiley & Sons, Chichester (2002)
Carlsson, M., Beldiceanu, N.: Arc-consistency for a Chain of Lexicographic Ordering Constraints. Technical Report T2002-18, Swedish Institute of Computer Science (2002)
Carlsson, M., Beldiceanu, N.: Revisiting the Lexicographic Ordering Constraint. Technical Report T2002-17, Swedish Institute of Computer Science (2002)
Carlsson, M., et al.: SICStus Prolog User’s Manual. Swedish Institute of Computer Science, 3.10 edn. (January 2003), http://www.sics.se/sicstus/
Beldiceanu, N., Aggoun, A.: Time stamps techniques for the trailed data in CLP systems. In: Actes du Séminaire 1990 - Programmation en Logique, Tregastel, France, CNET (1990)
Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Global Constraints for Lexicographic Orderings. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 93–108. Springer, Heidelberg (2002)
Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications, http://www.grappa.univ-lille3.fr/tata/
COSYTEC S.A. CHIP Reference Manual, version 5 edn., The sequence constraint (1996)
Régin, J.-C., Puget, J.F.: A filtering algorithm for global sequencing constraints. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 32–46. Springer, Heidelberg (1997)
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
Carlsson, M., Beldiceanu, N. (2004). From Constraints to Finite Automata to Filtering Algorithms. In: Schmidt, D. (eds) Programming Languages and Systems. ESOP 2004. Lecture Notes in Computer Science, vol 2986. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24725-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-24725-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21313-0
Online ISBN: 978-3-540-24725-8
eBook Packages: Springer Book Archive