The well known dichotomy conjecture of Feder and Vardi states that for every finite family Γ of constraints CSP(Γ) is either polynomially solvable or NP-hard. Bulatov and Jeavons re- formulated this conjecture in terms of the properties of the algebra P ol(Γ), where the latter is the collection of those ... more >>>