PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Caterpillar duality for constraint satisfaction problems
Victor Dalmau and Andrei Krokhin
In: Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008(2008).


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.

EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:5288
Deposited By:Victor Dalmau
Deposited On:24 March 2009