Complexity of conservative constraint satisfaction problems

@article{Bulatov2011ComplexityOC,
  title={Complexity of conservative constraint satisfaction problems},
  author={Andrei A. Bulatov},
  journal={ACM Trans. Comput. Log.},
  year={2011},
  volume={12},
  pages={24:1-24:66}
}
  • A. Bulatov
  • Published 1 July 2011
  • Computer Science
  • ACM Trans. Comput. Log.
In a constraint satisfaction problem (CSP), the aim is to find an assignment of values to a given set of variables, subject to specified constraints. The CSP is known to be NP-complete in general. However, certain restrictions on the form of the allowed constraints can lead to problems solvable in polynomial time. Such restrictions are usually imposed by specifying a constraint language, that is, a set of relations that are allowed to be used as constraints. A principal research direction aims… 

Constraint Satisfaction Parameterized by Solution Size

TLDR
In the case of constraint languages closed under substitution of constants, this paper gives a complete characterization of the fixed-parameter tractable cases of CSPs with size constraints, and shows that all the remaining problems are W[1]-hard.

Asking the Metaquestions in Constraint Tractability

TLDR
This article systematically studies—for various classes of polymorphisms—the computational complexity of deciding whether or not a given structure ℍ admits a polymorphism from the class, and proves the NP-completeness of deciding a condition conjectured to characterize the tractable problems CSP(ℍ).

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting

TLDR
This article addresses the general limit of the mentioned tractability results for CSP and #CSP, that they only apply to instances where all constraints belong to a single tractable language (in general, the union of two tractable languages is not tractable).

The Complexity of General-Valued CSPs

TLDR
It is proved that if a constraint language satisfies this algebraic necessary condition for tractability of a general-valued CSP with a fixed constraint language, then the VCSP is tractable.

The Power of Linear Programming for Valued CSPs

TLDR
This work obtains tractability of several novel and previously widely-open classes of VCSPs, including problems over valued constraint languages that are: sub modular on arbitrary lattices, bisubmodular on arbitrary finite domains, and weakly (and hence strongly) tree-sub modular on arbitrarily trees.

The Constraint Satisfaction Problem: Complexity and Approximability

TLDR
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.

Testing the complexity of a valued CSP language

TLDR
It is proved that for any constant $\delta<1$ there is no $O(\sqrt[3]{3}^{\,\delta|D|})$ algorithm, assuming that SETH holds, and a matching lower bound under the Strong Exponential Time Hypothesis is obtained.

Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries

  • D. Marx
  • Computer Science, Mathematics
    JACM
  • 2013
TLDR
The goal is to characterize those classes of hypergraphs for which CSP(H) is polynomial-time solvable or fixed-parameter tractable, parameterized by the number of variables, and to prove via a series of combinatorial results that if a hypergraph H has large submodular width, then a 3SAT instance can be efficiently simulated by a CSP instance whose hypergraph is H.

Harnessing tractability in constraint satisfaction problems

TLDR
This thesis attempts to bridge the gap between practitioners and theorists of CSP by providing polynomial-time algorithms to test for membership in a selection of major tractable classes, and proposes a general framework to adapt the concept of kernelization, central to parameterized complexity but hitherto rarely used in practice, to the context of constraint reasoning.

Time Complexity of Constraint Satisfaction via Universal Algebra

TLDR
The worst-case time complexity of NP-complete CSPs, where one is allowed to arbitrarily restrict the values of individual variables, is studied, and it is proved that the complexity of CSP({SD}) is a lower bound for all C SPs of this particular kind.
...

References

SHOWING 1-10 OF 67 REFERENCES

A dichotomy theorem for constraints on a three-element set

  • A. Bulatov
  • Computer Science
    The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
  • 2002
TLDR
Every subclass of the CSP defined by a set of allowed constraints is either tractable or NP-complete, and the criterion separating them is that conjectured by Bulatov et al. (2001).

Closure properties of constraints

TLDR
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.

A dichotomy theorem for constraint satisfaction problems on a 3-element set

TLDR
Every subproblem of the CSP is either tractable or NP-complete, and the criterion separating them is that conjectured in Bulatov et al.

The complexity of maximal constraint languages

TLDR
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.

Characterising Tractable Constraints

Classifying the Complexity of Constraints Using Finite Algebras

TLDR
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.

Constraints and universal algebra

TLDR
It is shown that a constraint satisfaction problem instance can be viewed as a pair of relational structures, and the solutions to the problem are then the structure preserving mappings between these two relational structures.

A new tractable class of constraint satisfaction problems

  • V. Dalmau
  • Mathematics, Computer Science
    Annals of Mathematics and Artificial Intelligence
  • 2005
TLDR
A new class of problems called para-primal problems, incomparable with the families identified by Feder and Vardi (1998), is introduced and it is proved that any constraint problem in this class is decidable in polynomial time.

Constraint Satisfaction Problems in Non-deterministic Logarithmic Space

  • V. Dalmau
  • Mathematics, Computer Science
    ICALP
  • 2002
TLDR
A general condition called bounded path duality is identified, that explains all the families of CSPs previously known to be in NL, and it is shown that closure under any operation in the pseudovariety generated by the class of dual discriminator operations is a sufficient condition for bounded pathDuality.

The complexity of satisfiability problems

TLDR
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.
...