2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/137879We prove that the constraint languages invariant under a short sequence of Jónsson 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.LogicComputational Complexity68N17 (Primary) 08A70, 08B10, 08B05, 03B70, 68T20 (Secondary)text