The constraint programming paradigm has proved to have the flexibility and efficiency necessary to treat well-defined largescale optimisation (LSCO) problems. Many real world problems, however, are ill-defined, incomplete, or have uncertain data. Research on ill-defined LSCO problems has centred on modelling the uncertainties by approximating the state of the real world, with no guarantee as a result that the actual problem is being solved. We locus here on ill-defined data, motivated by problems from energy trading and computer network optimisation, where no probability distribution is known or can be usefully obtained. We suggest a non-probabilistic certaint)., closure approach to model the data uncertainty, discuss the formalism and semantics required to build a constraint solving system based on such a computation domain, and give examples in the case of linear systems.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.