Sökning: onr:"swepub:oai:DiVA.org:ri-24361" >
Linking Prefixes an...
Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators
-
- Beldiceanu, Nicolas (författare)
- CNRS INRIA, France
-
- Carlsson, Mats (författare)
- RISE,Computer Systems Laboratory
-
- Flener, Pierre (författare)
- Uppsala universitet,Datalogi,ASTRA,Uppsala University, Sweden
-
visa fler...
-
- Francisco Rodríguez, María Andreína (författare)
- Uppsala universitet,Datalogi,ASTRA,Uppsala University, Sweden
-
- Pearson, Justin (författare)
- Uppsala universitet,Datalogi,ASTRA,Uppsala University, Sweden
-
visa färre...
-
(creator_code:org_t)
- 7
- Cham : Springer International Publishing, 2014
- 2014
- Engelska.
-
Ingår i: Principles and Practice of Constraint Programming. - Cham : Springer International Publishing. - 9783319104270 ; , s. 142-157
- Relaterad länk:
-
http://link.springer...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas