ИСТИНА

At the previous AAA conference I presented an algorithm that solves a constraint satisfaction problem on 5-element domain in polynomial time if all constraints are preserved by a weak near-unanimity operation. This time I present a modi ed version of the algorithm, and formulate a condition that is sufficient for the algorithm to work in general. This condition holds for small domains and possibly holds for any domain.