Beldiceanu, Nicolas and Carlsson, Mats and Debruyne, Romuald and Petit, Thierry (2005) Reformulation of global constraints based on constraint checkers. Constraints, 10 (4).
Full text not available from this repository.
Official URL: http://springerlink.metapress.com/openurl.asp?genr...
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.
|Deposited By:||ISL Researcher|
|Deposited On:||19 Jan 2006|
|Last Modified:||18 Nov 2009 15:54|
Repository Staff Only: item control page