Using Constraint Programming for Solving Distance CSP with Uncertainty

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 class of problems. The main idea consists in solving the CSP without taking into account the uncertainties and using this information to approximate the solution space of the original CSP. This methodology permits to obtain an interior and exterior approximation of each solution sub-space by a set of disjoint boxes.

• Type: Conference
• Year: 2005
• Where: CP
• Authors: Carlos Grandón, Bertrand Neveu
• Keywords: CP 2005, Many Problems, Original Csp, Programming Languages, Specific Methodology