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
Iterative solution of nonlinear equations in several variables
Iterative solution of nonlinear equations in several variables
A Constraint Satisfaction Approach to a Circuit Design Problem
Journal of Global Optimization
Handling Differential Equations with Constraints for Decision Support
FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Consistency techniques for numeric CSPs
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Hi-index | 0.00 |
This paper addresses constraint solving over continuous domains in the context of decision making, and discusses the trade-off between precision in the definition of the solution space and the computational effort required. In alternative to local consistency, which is usually maintained in handling continuous constraints, we discuss maintaining global hull-consistency. Experimental results show that this may be an appropriate choice, achieving acceptable precision with relatively low computational cost. The approach relies on efficient algorithms and the best results are obtained with the integration of a local search procedure within interval constraint propagation.