We report on the extension of the concurrent constraint language Oz by constraints over nite sets of integers. Set constraints are an important addition to the constraint programming system Oz and are very employable in natural language processing and general problem solving. This extension pro ts much from its integration with the existing constraint systems over nite domains and feature trees, as well as from the availability of rst-class procedures. This combination of features is unique to Oz. This paper focuses on the expressiveness gained by set constraints and on the bene ts of the integration with nite domain constraints. A number of case studies demonstrates programming techniques exploring these advantages.