| - Up - | Next >> |
Concurrent constraint programming allows to solve combinatoric problem efficiently. The problem with combinatoric problems is that the number of combinations to be considered may grow exponatially. Therefore, it is not possible to generate and test all combinations. Generate and test quickly leads to a combinatoric explosion even for small problems.
Concurrent constraint programming helps to avoid the combinatoric explosion. The idea is to perform simple inferences first in order to avoid superflues case distinctions. This method is called `propagate and distribute' where propagation performs simple inferences and distribution case distinctions.
| - Up - | Next >> |