量化约束的复杂性:可量化性、可切换性和代数公式
The complexity of quantified constraints: collapsibility, switchability and the algebraic formulation
摘要:
设A是有限域上的幂等代数.通过在Chen和Zhuk的结果之间进行中介,我们证明了如果A满足多项式生成幂性质(PGP),并且B是A下的约束语言不变量(即在Inv(A)中),那么QCSP(B)是在NP中的.在这样做,我们研究的特殊形式的PGP,可切换性和可扩展性,详细地,代数和逻辑,解决各种问题,如可判定性的方式。然后,我们证明了一个复杂性理论的逆命题逻辑编码的无限约束语言的情况下,如果Inv(A)满足指数生成的权力性质(EGP),那么QCSP(Inv(A))是co-NP-hard。由于Zhuk证明了只有PGP和EGP是可能的,我们推导出了QCSP的完全二分法,证明了我们称之为修正的陈猜想。当原来的陈猜想被证明是错误的时候,这个结果变得更加重要。可切换性由Chen引入,作为对已知可切换性的概括。对于可交换的三元Domain代数A,我们证明了:对于Inv(A)的每个有限子集D,Pol(D)是可折叠的.这一点的意义在于,对于有限结构上的QCSP(在三元素域上),所有由可切换性解释的QCSP易处理性(在P中)已经由易处理性解释。
英文摘要:
Let A be an idempotent algebra on a finite domain. By mediating between results of Chen and Zhuk, we argue that if A satisfies the polynomially generated powers property (PGP) and B is a constraint language invariant under A (that is, in Inv(A)), then QCSP(B) is in NP. In doing this we study the special forms of PGP, switchability and collapsibility, in detail, both algebraically and logically, addressing various questions such as decidability on the way. We then prove a complexity-theoretic converse in the case of infinite constraint languages encoded in propositional logic, that if Inv(A) satisfies the exponentially generated powers property (EGP), then QCSP(Inv(A)) is co-NP-hard. Since Zhuk proved that only PGP and EGP are possible, we derive a full dichotomy for the QCSP, justifying what we term the Revised Chen Conjecture. This result becomes more significant now the original Chen Conjecture is known to be false. Switchability was introduced by Chen as a generalisation of the already-known collapsibility. For three-element domain algebras A that are switchable and omit a G-set, we prove that, for every finite subset D of Inv(A), Pol(D) is collapsible. The significance of this is that, for QCSP on finite structures (over a three-element domain), all QCSP tractability (in P) explained by switchability is already explained by collapsibility.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。