SLIDE: A Useful Special Case of the CARDPATH Constraint

Details SLIDE: A Useful Special Case of the CARDPATH Constraint SLIDE: A Useful Special Case of the CARDPATH Constraint

2009-03-03

arxiv.org/abs/0903.0471v1

ECAI 2008: 475-479

Computer Science

Artificial Intelligence

18th European Conference on Artificial Intelligence

Scientific paper

10.3233/978-1-58603-891-5-475

We study the CardPath constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CardPath where the slid constraint must hold always, can be used to encode a wide range of sliding sequence constraints including CardPath itself. We consider how to propagate SLIDE and provide a complete propagator for CardPath. Since propagation is NP-hard in general, we identify special cases where propagation takes polynomial time. Our experiments demonstrate that using SLIDE to encode global constraints can be as efficient and effective as specialised propagators.

Affiliated with

Also associated with

No associations

Rating

SLIDE: A Useful Special Case of the CARDPATH Constraint does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with SLIDE: A Useful Special Case of the CARDPATH Constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and SLIDE: A Useful Special Case of the CARDPATH Constraint will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-652859