I'm reading a paper about interactive clustering, and I'm stuck with a definition about stability property of a clustering (based on this paper):

What I understand is that $A$ and $A$ are samples of the data, and a clustering algorithm $C$ is stable for all $A$ and $A$`.
If, I'm correct, the similarity function $S(A, A')$ close to $0$ if they are similar.
What I don't understand is why they use $\backslash$ (set difference) and I can't understand why $S(A, C_{i} \backslash A) > S(A, A')$