A modification of the CSP algorithm for infinite languages
arXiv:1803.07465
Abstract
Constraint Satisfaction Problem on finite sets is known to be NP-complete in general but certain restrictions on the constraint language can ensure tractability. It was proved that if a constraint language has a weak near unanimity polymorphism then the corresponding constraint satisfaction problem is tractable, otherwise it is NP-complete. In the paper we present a modification of the algorithm that works in polynomial time even for infinite constraint languages.
arXiv admin note: substantial text overlap with arXiv:1704.01914