New Conditions for Taylor Varieties and CSP

Authors:
Libor Barto;Marcin Kozik
Affiliations:
-;-
Venue:
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Year:
2010

Citing 0
Cited 5

Constraint satisfaction problems and global cardinality constraints

Communications of the ACM
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)
Constraint satisfaction tractability from semi-lattice operations on infinite sets

ACM Transactions on Computational Logic (TOCL)
Constraint Satisfaction Problems Solvable by Local Consistency Methods

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.02

Visualization

Abstract

We provide two new characterizations for finitely generated varieties with Taylor terms. The first characterization is using "absorbing sets" and the second one "cyclic operations". These new conditions allow us to reprove the conjecture of Bang-Jensen and Hell (proved by the authors, comp. STOC'08, SICOMP'09) and the characterization of locally finite Taylor varieties using weak near-unanimity operations (proved by McKenzie and Maroti, Alg.Univ. 2009) in an elementary and self-contained way. The research is closely connected to the algebraic approach to CSP and previous results obtained by authors using similar tools [comp. STOC'08, SICOMP'09, FOCS'09 etc.].