arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.06704math.LO
收藏

CSP二分性证明中泛代数的证明复杂性

Proof complexity of universal algebra in a CSP dichotomy proof

Azza Gaysin

AI总结:

本研究在有界算术$W^1_1$中形式化了支撑Zhuk CSP算法的泛代数定理证明,结合前期结果证明了算法可靠性,进而推出不可满足CSP实例的无解重言式在命题演算$G$中有短证明。

摘要:

约束满足问题(CSP)可表述为关系结构之间的同态问题:给定结构$\u27e8A\u27e9$,对于任意结构$\u27e8X\u27e9$,是否存在从$\u27e8X\u27e9$到$\u27e8A\u27e9$的同态。多年来,学界一直推测所有此类问题都分为多项式时间可解问题和NP完全问题,该猜想于2017年由Zhuk(2017)和Bulatov(2017)分别证明。Zhuk算法可在多项式时间内求解易处理的CSP,该算法部分基于泛代数定理:粗略来说,这些定理指出将实例的某个论域约简为其强子宇宙后,可满足实例仍保持解的存在性。\n本文中,我们给出了这些定理的证明在Skelley(2004)提出的有界算术$W^1_1$中的形式化。该形式化结合我们此前(2022年)的研究结果表明,$W_1^1$可证明Zhuk算法的可靠性,此处可靠性指算法的任何拒绝判定都是正确的。根据该理论与命题演算$G$的已知关系可得,表达不可满足实例无解的重言式在$G$中存在短证明。

英文摘要:

The constraint satisfaction problem (CSP) can be formulated as a homomorphism problem between relational structures: given a structure $\mathcal{A}$, for any structure $\mathcal{X}$, whether there exists a homomorphism from $\mathcal{X}$ to $\mathcal{A}$. For years, it has been conjectured that all problems of this type are divided into polynomial-time and NP-complete problems, and the conjecture was proved in 2017 separately by Zhuk (2017) and Bulatov (2017). Zhuk's algorithm solves tractable CSPs in polynomial time. The algorithm is partly based on universal algebra theorems: informally, they state that after reducing some domain of an instance to its strong subuniverses, a satisfiable instance maintains a solution. In this paper, we present the formalization of the proofs of these theorems in the bounded arithmetic $W^1_1$ introduced by Skelley (2004). The formalization, together with our previous results (2022), shows that $W_1^1$ proves the soundness of Zhuk's algorithm, where by soundness we mean that any rejection of the algorithm is correct. From the known relation of the theory to propositional calculus $G$, it follows that tautologies, expressing the non-existence of a solution for unsatisfiable instances, have short proofs in $G$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑