From Constraints to Finite Automata to Filtering Algorithms

  • Mats Carlsson
  • Nicolas Beldiceanu
Conference paper

DOI: 10.1007/978-3-540-24725-8_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2986)
Cite this paper as:
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


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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Mats Carlsson
    • 1
  • Nicolas Beldiceanu
    • 2
  1. 1.SICSKISTASweden
  2. 2.LINA FRE CNRS 2729 École des Mines de Nantes La ChantrerieNANTES Cedex 3France

Personalised recommendations