From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs Under Interv

One of the important components of granular computing is interval computations. In interval computations, at each intermediate stage of the computation, we have intervals of possible values of the corresponding quantities. In our previous papers, we proposed an extension of this technique to set computations, where on each stage, in addition to intervals of possible values of the quantities, we also keep sets of possible values of pairs (triples, etc.). In this paper, we show that in several practical problems, such as estimating statistics (variance, correlation, etc.) and solutions to ordinary differential equations (ODEs) with given accuracy, this new formalism enables us to find estimates in feasible (polynomial) time. 1 

• Type: Conference
• Year: 2007
• Where: IFSA
• Authors: Martine Ceberio, Vladik Kreinovich, Andrzej Pownuk, Barnabás Bede
• Keywords: Artificial Intelligence, Granular Computing, IFSA 2007, Interval Computations, Possible Values