Backtracking algorithms work by choosing an unassigned variable and recursively solve the problems obtained by assigning a value to this variable.
On the other hand, if a subset of this evaluation is inconsistent, the corresponding constraint may be useful in the subsequent search, as the same subset of the partial evaluation may occur again in the search.