CD(4) has bounded width

We prove that the constraint languages invariant under a short sequence of J´onsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they have bounded width. This improves the previous result by Kiss and Valeriote [15] and presents some evidence that the Larose-Z´adori conjecture [19] holds in the congruence-distributive case.

• Type: Journal
• Year: 2007
• Where: CORR
• Authors: Catarina Carvalho, Víctor Dalmau, Petar Markovic, Miklós Maróti
• Keywords: CORR 2007, Education, J´onsson Terms, Non-trivial Ternary Terms, Short Sequence