We propose a parametric introduction of intensionally defined sets into any CLP(D) language. The result is a language CLP(D), where constraints over sets of elements of D and over sets of sets of elements, and so on, can be expressed. The semantics of CLP(D) is based on the semantics of logic programs with aggregates and the semantics of CLP over sets. We investigate the problem of constraint resolution in CLP(D) and propose algorithms for constraints simplification.