Under the auspices of the Computational Complexity Foundation (CCF)
We give in this paper a different and simpler proof of the tractability of Mal'tsev contraints.
