Abstract. We present a consistency-based service composition approach, where composition problems are modelled in a generic manner using a generative constraint-based formalism. We show that in our framework concise formal specification of service configuration problems is possible. Preliminary results indicate that our approach is scalable and competitive with other state-of-the-art composition systems. 