Distributed Constraint Optimization Problems (DCOPs) have been applied in modeling and solving many multiagent coordination problems, such as meeting scheduling, sensor networks and traffific control. Several distributed algorithms for optimal DCOP solving have been proposed: ADOPT [Modi et al., 2005], DPOP [Petcu and Faltings, 2005], BnB-ADOPT [Yeoh et al., 2010]. BnB-ADOPT+-AC and BnB-ADOPT+- FDAC [Gutierrez and Meseguer, 2010a] incorporate consistency enforcement during search into BnB-ADOPT+ [Gutierrez and Meseguer, 2010b], obtaining effificiency improvements. Enforcing consistency allows to prune some suboptimal values, making the search space smaller. This previous work considers unconditional deletions only, which avoids overhead in handling assignments and backtracking. However, values that could be deleted conditioned to some assignments will not be pruned with this strategy, so search space reduction opportunities are missed