Consider a constraint on a sequence of variables functionally determining a result variable that is unchanged under reversal of the sequence. Most such constraints have a compact encoding via an automaton augmented with accumulators, but it is unknown how to maintain domain consistency efficiently for most of them. Using such an automaton for such a constraint, we derive an implied constraint between the result variables for a sequence, a prefix thereof, and the corresponding suffix. We show the usefulness of this implied constraint in constraint solving, both by local search and by propagation-based systematic search. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Beldiceanu, N., Carlsson, M., Flener, P., Rodríguez, M. A. F., & Pearson, J. (2014). Linking prefixes and suffixes for constraints encoded using automata with accumulators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8656 LNCS, pp. 142–157). Springer Verlag. https://doi.org/10.1007/978-3-319-10428-7_13
Mendeley helps you to discover research relevant for your work.