Beldiceanu, Nicolas; Flener, P; Pearson, J; Van Hentenryck, Pascal
Constraints over finite sequences of variables are ubiquitous in sequencing and timetabling. This led to general modelling techniques and generic propagators, often based on deterministic finite automata (DFA) and their extensions. We consider counter-DFAs (cDFA). which provide concise models for regular counting constraints, that is constraints over the number of times a regular-language pattern occurs in a sequence. We show how to enforce domain consistency in polynomial time for at-most and...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.