Caterpillar duality for constraint satisfaction problems

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2008, Pages 307-316

  Carvalho, Catarina ^a   Dalmau, Víctor ^b   Krokhin, Andrei ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE;

CONSTRAINT SATISFACTION PROBLEMS; DATA LOGS;

STEELMAKING;

EID: 51549116129     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2008.19     Document Type: Conference Paper

References (26)

1. A. Atserias. On digraph coloring problems and treewidth duality. European Journal of Combinatorics, 2008. to appear.
2. L. Barto, M. Kozik, and T. Niven. Graphs, polymorphisms and the complexity of homomorphism problems. In STOC'08, 2008. to appear.
3. A. Bulatov. H-coloring dichotomy revisited. Theoretical Computer Science, 349(1):31-39, 2005.
4. A. Bulatov, A. Krokhin, and B. Larose. Dualities for constraint satisfaction problems. In Surveys on Complexity of Constraints. 2008. (to appear).
5. D. Cohen and P. Jeavons. The complexity of constraint languages. In F. Rossi, P. van Beek, and T. Walsh, editors, Handbook of Constraint Programming, chapter 8. Elsevier, 2006.
6. V. Dalmau. Linear Datalog and bounded path duality for relational structures. Logical Methods in Computer Science, 1(1), 2005. (electronic).
7. V. Dalmau and J. Pearson. Set functions and width 1 problems. In CP'99, volume 1713 of LNCS, pages 159-173, 1999.
8. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1999.
9. L. Egri, B. Larose, and P. Tesson. Symmetric Datalog and constraint satisfaction problems in Logspace. In LICS'07, pages 193-202, 2007.
10. T. Feder and P. Hell. List homomorphisms to reflexive graphs. Journal of Combinatorial Theory, Ser. B, 72:236-250, 1998.
11. T. Feder and M. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing, 28:57-104, 1998.
12. G. Grätzer. General Lattice Theory. Birkhäuser, 2nd edition, 2002.
13. M. Grohe. The structure of tractable constraint satisfaction problems. In MFCS'06, volume 4162 of LNCS, pages 58-72, 2006.
14. A. Gupta, P. Hell, M. Karimi, and A. Rafiey. Minimum cost homomorphisms to reflexive digraphs. In LATIN'08, volume 4957 of LNCS, 2008. to appear.
15. P. Hell and J. Nešetřil. Graphs and Homomorphisms. Oxford University Press, 2004.
16. P. Hell, J. Nešetřil, and X. Zhu. Duality of graph homomorphisms. In Combinatorics, Paul Erdös is Eighty (Vol. 2), volume 2 of Bolyai Soc. Math. Stud., pages 271-282. János Bolyai Math. Soc, 1996.
17. P. Hell and X. Zhu. Homomorphisms to oriented paths. Discrete Mathematics, 132:107-114, 1994.
18. P. Idziak, P. Markovic, R. McKenzie, M. Valeriote, and R. Willard. Tractability and learnability arising from algebras with few subpowers. In LICS'07, pages 213-222, 2007.
19. P. Kolaitis. On the expressive power of logics on finite models. In Finite Model Theory and its Applications, EATCS Series: Texts in Theoretical Computer Science. Springer, 2007.
20. P. Kolaitis and M. Vardi. A logical approach to constraint satisfaction. In Finite Model Theory and its Applications, EATCS Series: Texts in Theoretical Computer Science. Springer, 2007.
21. A. Krokhin, A. Bulatov, and P. Jeavons. The complexity of constraint satisfaction: an algebraic approach. In Structural Theory of Automata, Semigroups, and Universal Algebra, volume 207 of NATO Science Series 11: Math., Phys., Chem., pages 181-213. Springer Verlag, 2005.
22. B. Larose, C. Loten, and C. Tardif. A characterisation of first-order constraint satisfaction problems. Logical Methods in Computer Science, 3(4), 2007. (electronic).
23. B. Larose and P. Tesson. Universal algebra and hardness results for constraint satisfaction problems. In ICALP'07, volume 4596 of LNCS, pages 267-278, 2007.
24. C. Loten and C. Tardif. Majority functions on structures with finite duality. European Journal of Combinatorics, 2008. to appear.
25. J. Nešetřil and C. Tardif. Duality theorems for finite structures (characterising gaps and good characterisations). Journal of Combinatorial Theory, Ser. B, 80:80-97, 2000.
26. L. Zadori. Relational sets and categorical equivalence for algebras. International Journal of Algebra and Computation, 7(5):561-576, 1997.