A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is
A Mal'tsev operation is a ternary operation ϕ that satisfies the identities ϕ(x, y, y)= ϕ(y, y, x)=x. Constraint satisfaction problems involving constraints invariant under a Mal'tsev operation constitute an important class of constraint satisfaction problems, which includes the affine satisfiability problem, subgroup and near subgroup constraints, and many others. It is also known that any tractable case of the counting constraint satisfaction problem involves only Mal'tsev constraints. Thedoi:10.1137/050628957 fatcat:k2mog32d3nhj7hnse7xyliuf3q