15.1.3 Distribution

In general, constraint propagation is imcomplete. This means that a combinatoric problem cannot be solve due to simple inferences only. Thus, a propagation process may become stable, whithout having determined a solution of a combinatoric problem.

What is missing so far is the possibility to perform case distinctions. This can be done by distribution steps of the following form where A,B,C are propositional formulas: