无限大小的加权（关系）克隆的Galois连接
A Galois Connection for Weighted (Relational) Clones of Infinite Size
摘要：
有限域上克隆与关系克隆之间的伽罗瓦连接是求解非均匀约束满足问题（CSP）的计算复杂性的代数方法的基石之一。Cohen等人在有限生成的加权克隆和有限生成的加权关系克隆之间建立了伽罗瓦连接[SICOMP'13]，并询问这种连接是否普遍成立。我们肯定地回答这个问题的加权（关系）克隆与真正的权重，并显示相应的价值CSP的复杂性被保留。
英文摘要：
A Galois connection between clones and relational clones on a fixed finite domain is one of the cornerstones of the so-called algebraic approach to the computational complexity of non-uniform Constraint Satisfaction Problems (CSPs). Cohen et al. established a Galois connection between finitely-generated weighted clones and finitely-generated weighted relational clones [SICOMP'13], and asked whether this connection holds in general. We answer this question in the affirmative for weighted (relational) clones with real weights and show that the complexity of the corresponding valued CSPs is preserved.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
