Possibly they have, however they won't have been using it to reset bits in a value. XOR is not the same as a NOT+AND operation
There may be a way to use XOR to reset a bit in a value, but I can't think what it would be off the top of my head or why you would want to use it instead of the simple well known NOT+AND technique. Introducing XOR would make the calculation much more complex.
Here is a couple of simple truth tables with a pair of inputs. You can see where the results differ:
Code:
0 ^ 0 = 0
0 ^ 1 = 1
1 ^ 0 = 1
1 ^ 1 = 0
(~0) & 0 = 0
(~0) & 1 = 1
(~1) & 0 = 0
(~1) & 1 = 0
