Tractable conservative constraint satisfaction problems

@article{Bulatov2003TractableCC,
  title={Tractable conservative constraint satisfaction problems},
  author={Andrei A. Bulatov},
  journal={18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.},
  year={2003},
  pages={321-330}
}
  • A. Bulatov
  • Published 22 June 2003
  • Computer Science
  • 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
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. The principal research direction aims to distinguish those constraint languages, which give rise to… 

Figures from this paper

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.
The approximability of MAX CSP with fixed-value constraints
TLDR
Any MAX CSP problem with a finite set of allowed constraint types, which includes all fixed-value constraints (i.e., constraints of the form x = a), is either solvable exactly in polynomial time or else is APX-complete, even if the number of occurrences of variables in instances is bounded.
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
TLDR
It is proved that any constraint language with this algebraic property makes Max CSP hard at gap location 1, thus ruling out the existence of a polynomial-time approximation scheme for such problems.
Hard constraint satisfaction problems have hard gaps at location 1
Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms
TLDR
The quantified constraint satisfaction problem (QCSP), a more general framework in which variables can be quantified both universally and existentially, is concerned with and a complete complexity classification of maximal constraint languages is given.
The Computational Complexity of Quantified Constraint Satisfaction
TLDR
This dissertation investigates the computational complexity of cases of the QCSP where the types of constraints that may appear are restricted and introduces a new concept for proving QCSP tractability results called collapsibility.
An Algorithm for Constraint Satisfaction Problem
  • Dmitriy Zhuk
  • Computer Science, Mathematics
    2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)
  • 2017
TLDR
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 Approximability of Three-valued MAX CSP
TLDR
This paper establishes the first step in this direction by establishing this result for MAX CSP over a three-element domain and presents a simple description of all polynomial-time solvable cases of the problem, which uses the well-known algebraic combinatorial property of supermodularity.
Algorithms and Hardness Results for Some Valued CSPs
TLDR
The computational complexity of restrictions of two optimisation problems which are related to the CSP is studied and new tractability results for SFM on diamonds and evidence which supports the hypothesis that all modular lattices are tractable are obtained.
Relatively quantified constraint satisfaction
TLDR
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.
...
...

References

SHOWING 1-10 OF 39 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.
Characterising Tractable Constraints
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.
Constraint Satisfaction Problems and Finite Algebras
TLDR
It is shown that any restricted set of constraint types can be associated with a finite universal algebra and the result is a dichotomy theorem which significantly generalises Schaefer's dichotomy for the Generalised Satisfiability problem.
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.
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.
An Algebraic Approach to Multi-sorted Constraints
TLDR
A new algebraic framework is described which allows us to deal more precisely with problems where different variables may have different domains, and is able to identify new tractable classes of constraints by combining algorithms devised for the simplified, single domain, problem.
Constraints, Consistency and Closure
...
...