The complexity of promise SAT on non-Boolean domains

While 3-SAT is NP-hard, 2-SAT is solvable in polynomial time. Austrin, Guruswami, and H\r{a}stad established, in precise terms, that the transition from tractability to hardness occurs just after 2 [FOCS'14/SICOMP'17]. They showed that the problem of distinguishing k-CNF formulas that are g-satisfiable (i.e. some assignment satisfies at least g literals in every clause) from those that are not even 1-satisfiable is NP-hard if $\frac{g}{k} < \frac{1}{2}$ and is in P otherwise. We study a generalisation of SAT on arbitrary finite domains, with clauses that are disjunctions of unary constraints, and establish analogous behaviour. Thus we give a dichotomy for a natural fragment of promise constraint satisfaction problems (PCSPs) on arbitrary finite domains.