CD(4) has bounded width
Logic
2007-09-14 v1 Computational Complexity
Abstract
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 and presents some evidence that the Larose-Zadori conjecture holds in the congruence-distributive case.
Cite
@article{arxiv.0709.1934,
title = {CD(4) has bounded width},
author = {Catarina Carvalho and Víctor Dalmau and Petar Marković and Miklós Maróti},
journal= {arXiv preprint arXiv:0709.1934},
year = {2007}
}