Publication at Faculty of Mathematics and Physics |
2009
Abstract
We show that a constraint language with compatible Jónsson terms (or, equivalently, associated with an algebra generating a congruence distributive variety) defines a constraint satisfaction problem solvable by the local consistency checking algorithm.