Directional Consistency for Continuous Numerical Constraints

Details Directional Consistency for Continuous Numerical Constraints Directional Consistency for Continuous Numerical Constraints

2004-06-16

arxiv.org/abs/cs/0406025v1

Computer Science

Artificial Intelligence

16 pages, 3 figures

Scientific paper

Bounds consistency is usually enforced on continuous constraints by first decomposing them into binary and ternary primitives. This decomposition has long been shown to drastically slow down the computation of solutions. To tackle this, Benhamou et al. have introduced an algorithm that avoids formally decomposing constraints. Its better efficiency compared to the former method has already been experimentally demonstrated. It is shown here that their algorithm implements a strategy to enforce on a continuous constraint a consistency akin to Directional Bounds Consistency as introduced by Dechter and Pearl for discrete problems. The algorithm is analyzed in this framework, and compared with algorithms that enforce bounds consistency. These theoretical results are eventually contrasted with new experimental results on standard benchmarks from the interval constraint community.

Affiliated with

Also associated with

No associations

Rating

Directional Consistency for Continuous Numerical Constraints 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 Directional Consistency for Continuous Numerical Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Directional Consistency for Continuous Numerical Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-219244