Publication Date

2-2014

Comments

Technical Report: UTEP-CS-14-13

Published in Proceedings of the Seventh International Workshop on Constraints Programming and Decision Making CoProd'2014, Wuerzburg, Germany, September 21, 2014.

Abstract

One of the main problems of interval computations is computing the range of a given function over given intervals. It is known that there is a general algorithm for computing the range of computable functions over computable intervals. However, if we take into account that often in practice, not all possible combinations of the inputs are possible (i.e., that there are constraints), then it becomes impossible to have an algorithm which would always compute this range. In this paper, we explain that the main reason why range estimation under constraints is not always computable is that constraints may introduce discontinuity -- and all computable functions are continuous. Specifically, we show that if we restrict ourselves to computably continuous constraints, the problem of range estimation under constraints remains computable.

COinS