SwePub
Sök i LIBRIS databas

  Extended search

WFRF:(Beldiceanu Nicolas)
 

Search: WFRF:(Beldiceanu Nicolas) > Linking Prefixes an...

Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators

Beldiceanu, Nicolas (author)
CNRS INRIA, France
Carlsson, Mats (author)
RISE,Computer Systems Laboratory
Flener, Pierre (author)
Uppsala universitet,Datalogi,ASTRA,Uppsala University, Sweden
show more...
Francisco Rodríguez, María Andreína (author)
Uppsala universitet,Datalogi,ASTRA,Uppsala University, Sweden
Pearson, Justin (author)
Uppsala universitet,Datalogi,ASTRA,Uppsala University, Sweden
show less...
 (creator_code:org_t)
7
Cham : Springer International Publishing, 2014
2014
English.
In: Principles and Practice of Constraint Programming. - Cham : Springer International Publishing. - 9783319104270 ; , s. 142-157
  • Conference paper (peer-reviewed)
Abstract Subject headings
Close  
  • 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.

Subject headings

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)

Publication and Content Type

ref (subject category)
kon (subject category)

Find in a library

To the university's database

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view