

![0_image_0.png](0_image_0.png)

and Taii p for any density p are given in Figure and Figure respectively We also show these bounds for the variable completability filtering which removes all the globally inconsistent values  and thus is the strongest filtering we can have when we limit filtering to tion the domains To determine the To and Tail bounds CNs have been generated for each density tightness pair This explains why the generated problems are relatively small As already proved theoretically PIC is stronger than RPC Their pruning efficiencies are closed   RPC deletes most of the path inverse inconsistent values and is halfway between AC and Max RPC in terms of pruning efficiency   k RPC with k is incomparable with PIC with regard to the stronger relation  However  Figure   and Figure   show that RPC is more pruningful than PIC SAC and strong PC have almost the same pruning efficiency  Their To limits merge and their Tay limits show a slight difference  This confirms the similitude between SAC and strong PC pointed out in Section Although SRPC and strong PC are not comparable w r t  the stronger relation  SRPC removes is more pruningful than strong PC As predicted in  van Beek these polynomial filterings have more