The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case

  title={The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case},
  author={Hubie Chen},
  • Hubie Chen
  • Published 24 July 2006
  • Computer Science
  • ArXiv
The constraint satisfaction probem (CSP) is a well-acknowledged framework in which many combinatorial search problems can be naturally formulated. The CSP may be viewed as the problem of deciding the truth of a logical sentence consisting of a conjunction of constraints, in front of which all variables are existentially quantified. The quantified constraint satisfaction problem (QCSP) is the generalization of the CSP where universal quantification is permitted in addition to existential… 
Quantified constraint satisfaction and the polynomially generated powers property
This article identifies a new combinatorial property on algebras, the polynomially generated powers (PGP) property, which it is shown is tightly connected to QCSP complexity, and introduces another new property, switchability, which both implies the PGP property and implies positive complexity results on the QCSP.
Quantified Constraints and Containment Problems
This work gives an algorithm that determines whether "phi implies psi" is true in all structures (models) and shows that the entailment problem for positive first-order logic is undecidable.
The complexity of quantified constraints: collapsibility, switchability and the algebraic formulation
It is proved 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.
On the complexity of the model checking problem
The model checking problem for various fragments of first-order logic has attracted much attention over the last two decades: in particular, for the primitive positive and the positive Horn
The Constraint Satisfaction Problem: Complexity and Approximability
This report documents the material presented during the course of the Dagstuhl Seminar 18231 “The Constraint Satisfaction Problem: Complexity and Approximability”, aimed at bringing together researchers using all the different techniques in the study of the CSP to share their insights obtained.
Relatively quantified constraint satisfaction
This paper gives a complete complexity classification of the cases of the RQCSP where the types of constraints that may appear are specified by a constraint language.
A Proof of the CSP Dichotomy Conjecture
This article presents an algorithm that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture.
A Proof of CSP Dichotomy Conjecture
  • Dmitriy Zhuk
  • Mathematics, Computer Science
    2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
An algorithm is presented that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture.
The Complexity of Quantified Constraints Using the Algebraic Formulation
A full dichotomy for the QCSP is derived, justifying the moral correctness of the Chen Conjecture, and it is proved that for every finite subset Delta of Inv(A), Pol(Delta) is Collapsible.
From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP
It is proved that partially reflexive paths bequeath a set of idem potent polymorphisms whose associated clone algebra has: either the polynomially generated powers property (PGP), or the exponentially generated power property (EGP).


Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms
A complete classification of 2-semilattice polymorphisms is proved, demonstrating that each gives rise to a case of the QCSP that is either tractable in polynomial time, or coNP-hard.
Quantified Constraints: Algorithms and Complexity
This paper considers a more general framework for constraint satisfaction problems which allows arbitrary quantifiers over constrained variables, rather than just existential quantifiers, and shows that the complexity of such extended problems is determined by the surjective polymorphisms of the constraint predicates.
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Every subproblem of the CSP is either tractable or NP-complete, and the criterion separating them is that conjectured in Bulatov et al.
Tractable conservative constraint satisfaction problems
  • A. Bulatov
  • Computer Science
    18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
  • 2003
This work completely characterize conservative constraint languages that give rise to CSP classes solvable in polynomial time, and obtains a complete description of those (directed) graphs H for which the List H-Coloring problem is poynomial time solvable.
Classifying the Complexity of Constraints Using Finite Algebras
It is shown that any set of relations used to specify the allowed forms of constraints can be associated with a finite universal algebra and how the computational complexity of the corresponding constraint satisfaction problem is connected to the properties of this algebra is explored.
The complexity of maximal constraint languages
This paper systematically study the complexity of all maximal constraint languages, that is, languages whose expressive power is just weaker than that of the language of all constraints.
Closure properties of constraints
This paper investigates the subclasses that arise from restricting the possible constraint types, and shows that any set of constraints that does not give rise to an NP-complete class of problems must satisfy a certain type of algebraic closure condition.
The complexity of satisfiability problems
An infinite class of satisfiability problems is considered which contains these two particular problems as special cases, and it is shown that every member of this class is either polynomial-time decidable or NP-complete.
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
This paper isolates a class (of problems specified by) "monotone monadic SNP without inequality" which may exhibit a dichotomy, and explains the placing of all these restrictions by showing, essentially using Ladner's theorem, that classes obtained by using only two of the above three restrictions do not show this dichotomy.
A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas