Constraint reasoning based on interval arithmetic: the tolerance propagation approach
Artificial Intelligence - Special volume on constraint-based reasoning
Constraint arithmetic on real intervals
Constraint logic programming
Computer methods for design automation
Computer methods for design automation
Arc-consistency for continuous variables
Artificial Intelligence
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Solving Polynomial Systems Using a Branch and Prune Approach
SIAM Journal on Numerical Analysis
A Fortran Multiple-Precision Arithmetic Package
ACM Transactions on Mathematical Software (TOMS)
Synthesizing constraint expressions
Communications of the ACM
Consistency techniques for numeric CSPs
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Constraint (Logic) Programming: A Survey on Research and Applications
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Solving Constraints over Floating-Point Numbers
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
This paper investigates the relations among different partial consistencies which have been proposed for pruning the domains of the variables in constraint systems over the real numbers. We establish several properties of the filtering achieved by the algorithms based upon these partial consistencies. Especially, we prove that : 1) 2B-Consistency (or Hull consistency) algorithms actually yield a weaker pruning than Box-consistency; 2) 3B-Consistency algorithms perform a stronger pruning than Box-consistency. This paper also provides an analysis of both the capabilities and the inherent limits of the filtering algorithms which achieve these partial consistencies.