A neural based approach of constraints satisfaction problem

The authors recall the constraint programming approach to solving a constraint-satisfaction problem, and show that for each problem which can be described by this approach a neural network can be designed which solves the problem. They give an application of this method for solving a task assignment problem and compare the results with those which are obtained by other approaches. Because this network can be very large, a type of constraint which allows splitting the problem into two smaller problems is illustrated.<
>