Cookies

We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.


Durham Research Online
You are in:

Caterpillar duality for constraint satisfaction problems.

Carvalho, C. and Dalmau, V. and Krokhin, A. (2008) 'Caterpillar duality for constraint satisfaction problems.', in 23rd Annual IEEE Symposium on Logic in Computer Science, 24-27 June 2008, Pittsburgh, Pennsylvania ; proceedings. Los Alamitos, CA: IEEE, pp. 307-316.

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.

Item Type:Book chapter
Full text:PDF - Published Version (171Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.1109/LICS.2008.19
Publisher statement:© 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Record Created:15 Dec 2009 12:05
Last Modified:08 Nov 2010 12:04

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library