Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a specific methodology for tackling uncertainties in this...
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
Simon de Givry, Javier Larrosa, Pedro Meseguer, Th...
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...