In this chapter, we show how to solve dominance constraints by constraint programming with sets. While we won't say anything about the details, the techniques used here can be used as a basis to build more underspecified processing mechanisms for dominance constraints. For instance, the encoding of nodes presented below lends itself very well to capturing the interaction of scope and anaphora as in Every man loves a woman. Her name is Mary. In the sentence, the anaphoric reference excludes one reading of the first sentence; we can make this inference purely with propagation.