CONGRUENCE DISTRIBUTIVITY IMPLIES BOUNDED WIDTH
We show that a constraint language with compatible Jonsson terms (or, equivalently, associated with an algebra generating a congruence distributive variety) defines a constraint satisfaction problem solvable by the local consistency checking algorithm.
bounded width jonsson terms congruence distributive variety constraint satisfaction problem local consistency