Constraint satisfaction problems (CSPs) provide a versatile framework for modelling complex decision-making tasks where a collection of variables must be allocated values that satisfy specific ...

In this paper the relation between scientific problems and the constraints on their solutions is explored. First the historical constraints on the solution to the blackbody radiation problem are set ...

If you’ve ever completed a sudoku puzzle, then you’ve completed a constraint satisfaction problem (CSP). This type of problem is defined as a mathematical question where a number of constraints or ...

We investigate risk-averse stochastic optimization problems with a risk-shaping constraint in the form of a stochastic-order relation. Both univariate and multivariate orders are considered. We extend ...

Bayardo Jr., R. J.; Schrag, R. C. Using CSP look-back techniques to solve real world SAT instances. In: Proc. of the 14th National Conf. on Artificial Intelligence ...

As today’s designs become more complex, so too do their constraints. Design functionality typically gets a lot of attention – through code review, functional verification, etc. However, the ...