Constraint reasoning based on interval arithmetic: the tolerance propagation approach
Artificial Intelligence - Special volume on constraint-based reasoning
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
Revising hull and box consistency
Proceedings of the 1999 international conference on Logic programming
Interval analysis: theory and applications
Journal of Computational and Applied Mathematics - Special issue on numerical analysis in the 20th century vol. 1: approximation theory
Progress in the Solving of a Circuit Design Problem
Journal of Global Optimization
Constraint reasoning based on interval arithmetic
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Consistency techniques for numeric CSPs
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
We prove that hull consistency for a system of equations or inequalities can be achieved in polynomial time providing that the underlying functions are monotone with respect to each variable. This result holds including when variables have multiple occurrences in the expressions of the functions, which is usually a pitfall for interval-based contractors. For a given constraint, an optimal contractor can thus be enforced quickly under monotonicity and the practical significance of this theoretical result is illustrated on a simple example.