Caterpillar Duality for Constraint Satisfaction Problems

Authors:
Catarina Carvalho;Víctor Dalmau;Andrei Krokhin
Affiliations:
-;-;-
Venue:
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Year:
2008

Citing 0
Cited 3

Dualities for Constraint Satisfaction Problems

Complexity of Constraints
CSP duality and trees of bounded pathwidth

Theoretical Computer Science
Tree dualities for constraint satisfaction

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems that are definable in the smallest natural recursive fragment of Datalog - monadic linear Datalog with at most one EDB per rule. We give combinatorial and algebraic characterisations of such problems, in terms of caterpillar dualities and lattice operations, respectively. We then apply our results to study graph H-colouring problems.