Constraint propagation with interval labels
Artificial Intelligence
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Revising hull and box consistency
Proceedings of the 1999 international conference on Logic programming
A Visualization Tool for Constraint Program Debugging
ASE '99 Proceedings of the 14th IEEE international conference on Automated software engineering
Constraint Processing
Constraint BasedWorld Modeling
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Constraint based world modeling in mobile robotics
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Constraint BasedWorld Modeling
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
| Hi-index | 0.00 |
Local consistency is usually enforced on continuous constraints by decomposing them beforehand into so-called primitive constraints. It has long been observed that such a decomposition drastically slows down the computation of solutions. Five years ago, Benhamou et al. introduced an algorithm that avoids formally decomposing constraints, and whose efficiency is often on a par with state-of-the-art methods. It is shown here that this 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 actual impact of decomposition is also thoroughly analyzed by means of new experimental results.