Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators

Abstract

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.
No file

Dates and versions

hal-01086755 , version 1 (24-11-2014)

Identifiers

Cite

Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Maria Andreina, Justin Pearson. Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators. Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Sep 2014, Lyon, France. pp.15, ⟨10.1007/978-3-319-10428-7_13⟩. ⟨hal-01086755⟩
141 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More