Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s10601-005-2809-x | Constraints |
Keywords | Field | DocType |
global constraints,automata,reformulation | Metaprogramming,Discrete mathematics,Mathematical optimization,Deterministic automaton,Polynomial,Computer science,Automaton,Finite-state machine,Probabilistic automaton,Büchi automaton,Bounded function | Journal |
Volume | Issue | ISSN |
10 | 4 | 1383-7133 |
Citations | PageRank | References |
19 | 0.97 | 27 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicolas Beldiceanu | 1 | 547 | 51.14 |
| Mats Carlsson | 2 | 975 | 79.24 |
| Romuald Debruyne | 3 | 272 | 15.91 |
| Thierry Petit | 4 | 94 | 6.97 |