Combinatorial problems are generally modeled as constraintsatisfaction problems (CSP) or Boolean satisfiability problem (SAT). Modeling and resolution of CSP is often strenghtened by global constraints (e.g., Alldiff constraint) whereas no such high level feature is offered in SAT. In this paper, we propose a uniform propagation framework to handle Alldiff constraints (possibly interleaved) with some reduction rules. We also propose a SAT encoding of these rules that preserves the reduction properties of CSP.