Finite Domain Bounds Consistency Revisited

Details Finite Domain Bounds Consistency Revisited Finite Domain Bounds Consistency Revisited

2004-12-06

arxiv.org/abs/cs/0412021v1

Computer Science

Artificial Intelligence

12 pages

Scientific paper

A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagation is performed by propagators implementing a certain notion of consistency. Bounds consistency is the method of choice for building propagators for arithmetic constraints and several global constraints in the finite integer domain. However, there has been some confusion in the definition of bounds consistency. In this paper we clarify the differences and similarities among the three commonly used notions of bounds consistency.

Affiliated with

Also associated with

No associations

Rating

Finite Domain Bounds Consistency Revisited 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 Finite Domain Bounds Consistency Revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite Domain Bounds Consistency Revisited will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-40836