The Dichotomy for Conservative Constraint Satisfaction Problems Revisited

Authors:
Libor Barto
Affiliations:
-
Venue:
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Year:
2011

Citing 0
Cited 7

An algebraic theory of complexity for valued constraints: establishing a Galois connection

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On minimal weighted clones

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The complexity of conservative valued CSPs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The complexity of conservative valued CSPs

Journal of the ACM (JACM)
The complexity of finite-valued CSPs

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The complexity of the counting constraint satisfaction problem

Journal of the ACM (JACM)
Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A central open question in the study of non-uniform constraint satisfaction problems (CSPs) is the dichotomy conjecture of Feder and Vardi stating that the CSP over a fixed constraint language is either NP-complete, or tractable. One of the main achievements in this direction is a result of Bulatov (LICS'03) confirming the dichotomy conjecture for conservative CSPs, that is, CSPs over constraint languages containing all unary relations. Unfortunately, the proof is very long and complicated, and therefore hard to understand even for a specialist. This paper provides a short and transparent proof.