The complexity of quantified constraints: collapsibility, switchability and the algebraic formulation

Carvalho, Catarina; Madelaine, Florent; Martin, Barnaby; Zhuk, Dmitriy

Abstract

Let A be an idempotent algebra on a finite domain. By mediating between results of Chen [1] and Zhuk [2], 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 (see [3]) is known to be false [4]. Switchability was introduced by Chen in [1] as a generalisation of the already-known collapsibility [5]. There, an algebra A := ({0, 1, 2}; 𝑟 ) was given that is switchable and not collapsible. We prove that, for all finite subsets Δ of Inv(A), Pol(Δ) is collapsible. The significance of this is that, for QCSP on finite structures, it is still possible all QCSP tractability (in NP) explained by switchability is already explained by collapsibility. At least, no counterexample is known to this.

Citation

Carvalho, C., Madelaine, F., Martin, B., & Zhuk, D. (2023). The complexity of quantified constraints: collapsibility, switchability and the algebraic formulation. ACM Transactions on Computational Logic, 24(1), Article 5. https://doi.org/10.1145/3568397

• Journal Article Type: Article
• Acceptance Date: Jun 24, 2022
• Online Publication Date: Oct 17, 2022
• Publication Date: 2023-01
• Deposit Date: Jul 16, 2022
• Publicly Available Date: Jul 18, 2022
• Journal: ACM Transactions on Computational Logic
• Print ISSN: 1529-3785
• Electronic ISSN: 1557-945X
• Publisher: Association for Computing Machinery (ACM)
• Peer Reviewed: Peer Reviewed
• Volume: 24
• Issue: 1
• Article Number: 5
• DOI: https://doi.org/10.1145/3568397
• Public URL: https://durham-repository.worktribe.com/output/1197589