We establish a framework that allows us to transfer results between some constraint satisfaction problems with infinite templates and promise constraint satisfaction problems. On the one hand, we obtain new algebraic results for infinite-domain CSPs giving new criteria for NP-hardness. On the other hand, we show the existence of promise CSPs with finite templates that reduce naturally to tractable infinite-domain CSPs within the scope of the Bodirsky-Pinsker conjecture, but that are not finitely tractable, thereby showing a non-trivial connection between those two fields of research. In an important part of our proof, we also obtain uniform polynomial-time algorithms solving temporal constraint satisfaction problems.

翻译：我们建立了一个框架，使得能够在某些具有无限模板的约束满足问题与承诺约束满足问题之间转移研究成果。一方面，我们为无限域约束满足问题获得了新的代数结果，给出了NP难度的新判定准则。另一方面，我们证明了存在具有有限模板的承诺约束满足问题，它们自然地归约到Bodirsky-Pinsker猜想范围内的可处理无限域约束满足问题，但其本身并非有限可处理的，从而揭示了这两个研究领域之间非平凡的内在联系。在我们证明的关键部分，我们还获得了求解时序约束满足问题的统一多项式时间算法。