Carvalho, C. and Dalmau, V. and Krokhin, A. (2008) 'Caterpillar duality for constraint satisfaction problems.', in Twenty-third Annual IEEE Symposium on Logic in Computer Science, 24-27 June 2008, Pittsburgh, PA ; proceedings. Los Alamitos, CA: IEEE, 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 |
|---|---|
| Keywords: | Constraint satisfaction problem, Homomorphism, Duality, Caterpillar structures, Datalog. |
| Full text: | (VoR) Version of Record Download PDF (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. |
| Date accepted: | No date available |
| Date deposited: | 08 November 2010 |
| Date of first online publication: | June 2008 |
| Date first made open access: | No date available |
Save or Share this output
| Export: | |
| Look up in GoogleScholar |
