Toward an automaton Constraint for Local Search
We explore the idea of using finite automata to implement new constraints for local search (this is already a successful technique in constraint-based global Bread search).We show how it is possible to maintain incrementally the violations of a constraint and its decision variables from an automaton that describes a ground checker for that constrai