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.
Original language | English |
---|---|
Pages (from-to) | 293-297 |
Journal | Algebra Universalis |
Volume | 60 |
DOIs | |
Publication status | Published - 2009 |
Keywords
- math.LO
- cs.CC
- 68N17 (Primary) 08A70, 08B10, 08B05, 03B70, 68T20 (Secondary)