Complexity of conservative constraint satisfaction problems

• Published in: ACM transactions on computational logic Vol. 12; no. 4; pp. 1 - 66
• Main Author: Bulatov, Andrei A.
• Format: Journal Article
• Language: English
• Published: 01.07.2011
• Subjects: Complexity; Computation; Constrictions; Logic; Mathematical analysis; Mathematical models
• ISSN: 1529-3785; 1557-945X
• DOI: 10.1145/1970398.1970400

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 to distinguish those constraint languages that give rise to tractable CSPs from those that do not. We achieve this goal for the important version of the CSP, in which the set of values for each individual variable can be restricted arbitrarily. Restrictions of this type can be studied by considering those constraint languages which contain all possible unary constraints; we call such languages conservative . We completely characterize conservative constraint languages that give rise to polynomial time solvable CSP classes. In particular, this result allows us to obtain a complete description of those (directed) graphs H for which the List H -Coloring problem is solvable in polynomial time. The result, the solving algorithm, and the proofs heavily use the algebraic approach to CSP developed in Jeavons et al. [1997], Jeavons [1998], Bulatov et al. [2005], and Bulatov and Jeavons [2001b, 2003].