Answers are grounded in this paper and cite their sources.
We show that various known algorithms for finite-domain constraint satisfaction problems (CSP), which are based on solving systems of linear equations over the integers, fail to solve all tractable CSPs correctly. The algorithms include Z-affine k-consistency, BLP+AIP, every fixed level of the BAᵏ-hierarchy, and the CLAP algorithm. In particular, we refute the conjecture by Dalmau and Opr{s}al that there is a fixed constant k such that the Z-affine k-consistency algorithm solves all tractable finite domain CSPs.
No takes yet. Share an insight, caveat, or question.
Lichter et al. (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: