The subject of arithmetic constraints on reals has attracted a great deal of attention in the literature. For some reason arithmetic constraints on integers have not been studied, even though they are supported in a number of constraint programming systems. In this presentation we will discuss various alternative approaches, based on interval arithmetic, to implementing these constraints. Also we present the outcome of experiments that were performed to assess these approaches on a number of benchmark problems.