, Volume 10, Issue 4, pp 339–362

Reformulation of Global Constraints Based on Constraints Checkers


    • LINA FRE CNRS 2729École des Mines de Nantes
  • Mats Carlsson
    • SICS
  • Romuald Debruyne
    • LINA FRE CNRS 2729École des Mines de Nantes
  • Thierry Petit
    • LINA FRE CNRS 2729École des Mines de Nantes

DOI: 10.1007/s10601-005-2809-x

Cite this article as:
Beldiceanu, N., Carlsson, M., Debruyne, R. et al. Constraints (2005) 10: 339. doi:10.1007/s10601-005-2809-x


This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in n, where n is the number of variables of the corresponding global constraint. By reducing the automaton to a conjunction of signature and transition constraints we show how to systematically obtain an automaton reformulation. Under some restrictions on the signature and transition constraints, this reformulation maintains arc-consistency. An implementation based on some constraints as well as on the metaprogramming facilities of SICStus Prolog is available. For a restricted class of automata we provide an automaton reformulation for the relaxed case, where the violation cost is the minimum number of variables to unassign in order to get back to a solution.


global constraintsautomatareformulation

Copyright information

© Springer Science + Business Media, Inc. 2005