The system's operation is illustrated by the following simple scenario. The system has arrived at the point where object A has three possible locations associated with it and B has four.
object: A [[000,001],[002,003],[020,021]]
object: B [[000..003],[010..013],[020..023],[030..033]]
Then given the constraint: constraint: A isSubset B each possible location of A must be tested against each location for B:
Only one location for B is compatible with each location of A. By grouping the results we arrive at two possible solutions:
object: A [[000,001], [002,003]]
object: B [000..003]
object: A [020,021]
object: B [020..023]
This result should be interpreted as follows: If A is at locations 000, 001 or 002,003, then B can only be at 000..003. If A is at 020, 021, B can only be at 020..23. Thus we are presented with alternative solutions to the problem presented to the system in terms of the possible locations for A and B, related by the given constraint.