CSP duality and trees of bounded pathwidth

Theoretical Computer Science

Volumn 411, Issue 34-36, 2010, Pages 3188-3208

  Carvalho, Catarina ^a   Dalmau, Vctor ^b   Krokhin, Andrei ^c  

^a UNIVERSITY OF LISBON   (Portugal)

^b UNIVERSITAT POMPEU FABRA   (Spain)

^c DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Bounded pathwidth; Constraint satisfaction problem; Datalog; Homomorphism duality; Polymorphisms

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; DATALOG; HYPERGRAPH; NEW PARAMETERS; NON-LINEARITY; NONUNIFORM; PATHWIDTH;

POLYMORPHISM;

EID: 77955413153     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.05.016     Document Type: Article

References (38)

1. I. Adler Marshals, monotone marshals, and hypertree width Journal of Graph Theory 47 4 2004 275 296
2. F. Afrati, S. Cosmodakis, Expressiveness of restricted recursive queries, in: STOC'89, 1989, pp. 113126.
3. L. Barrire, P. Fraigniaud, N. Santoro, and D. Thilikos Searching is not jumping WG'03 LNCS vol. 2880 2003 34 45
4. L. Barto, M. Kozik, Constraint satisfaction problems of bounded width, in: FOCS'09, 2009, pp. 595603.
5. A. Bulatov, Tractable conservative constraint satisfaction problems, in: LICS'03, 2003, pp. 321330.
6. A. Bulatov A dichotomy theorem for constraint satisfaction problems on a 3-element set Journal of the ACM 53 1 2006 66 120
7. A. Bulatov, P. Jeavons, and A. Krokhin Classifying complexity of constraints using finite algebras SIAM Journal on Computing 34 3 2005 720 742
8. A. Bulatov, A. Krokhin, and B. Larose Dualities for constraint satisfaction problems Complexity of Constraints LNCS vol. 5250 2008 93 124
9. A. Bulatov, and M. Valeriote Recent results on the algebraic approach to the CSP Complexity of Constraints LNCS vol. 5250 2008 68 92
10. C. Carvalho, V. Dalmau, A. Krokhin, Caterpillar duality for constraint satisfaction problems, in: LICS'08, 2008, pp. 307316.
11. D. Cohen, and P. Jeavons The complexity of constraint languages F. Rossi, P. van Beek, T. Walsh, Handbook of Constraint Programming 2006 Elsevier (Chapter-8)
12. N. Creignou, S. Khanna, and M. Sudan Complexity Classifications of Boolean Constraint Satisfaction Problems SIAM Monographs on Discrete Mathematics and Applications vol. 7 2001
13. V. Dalmau Linear Datalog and bounded path duality for relational structures Logical Methods in Computer Science 1 1 2005 (electronic)
14. V. Dalmau, and A. Krokhin Majority constraints have bounded pathwidth duality European Journal of Combinatorics 29 4 2008 821 837
15. V. Dalmau, A. Krokhin, and B. Larose First-order definable retraction problems for reflexive graphs and posets Journal of Logic and Computation 17 1 2007 31 51
16. L. Egri, B. Larose, P. Tesson, Symmetric Datalog and constraint satisfaction problems in Logspace, in: LICS'07, 2007, pp. 193202.
17. J. Ellis, I.H. Sudborough, and J. Turner The vertex separation and search number of a graph Information and Computation 113 1 1994 50 79
18. T. Feder, and M.Y. Vardi The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory SIAM Journal on Computing 28 1998 57 104
19. F. Fomin, and D. Thilikos An annotated bibliography on guaranteed graph searching Theoretical Computer Science 41 2 2008 381 393
20. G. Gottlob, N. Leone, and F. Scarcello Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width Journal of Computer and System Sciences 66 2003 775 808
21. E. Grdel, and G. McColm Hierarchies in transitive closure logic, stratified Datalog and infinitary logic Annals of Pure and Applied Logic 77 2 1996 169 199
22. N. Kinnersley The vertex separation number of a graph is equal to its path-width Information Processing Letters 42 6 1992 345 350
23. L.M. Kirousis, and C.H. Papadimitriou Searching and pebbling Theoretical Computer Science 47 3 1986 205 218
24. Ph.G. Kolaitis On the expressive power of logics on finite models Finite Model Theory and its Applications 2007 Springer 27 124
25. Ph.G. Kolaitis, and M.Y. Vardi A logical approach to constraint satisfaction Finite Model Theory and its Applications 2007 Springer 339 370
26. A.S. LaPaugh Recontamination does not help to search a graph Journal of the ACM 40 1993 224 245
27. B. Larose, and P. Tesson Universal algebra and hardness results for constraint satisfaction problems Theoretical Computer Science 410 18 2009 1629 1647
28. B. Larose, and L. Zdori Algebraic properties and dismantlability of finite posets Discrete Mathematics 163 1997 89 99
29. B. Larose, and L. Zdori The complexity of the extendibility problem for finite posets SIAM Journal on Discrete Mathematics 17 1 2003 114 121
30. B. Larose, and L. Zdori Bounded width problems and algebras Algebra Universalis 56 34 2007 439 466
31. M. Marti, and R. McKenzie Existence theorems for weakly symmetric operations Algebra Universalis 59 34 2008 463 489
32. N. Meggido, S. Hakimi, M. Garey, D. Johnson, and C. Papadimitriou The complexity of searching a graph Journal of the ACM 35 1 1988 18 44
33. R.H. Mhring Graph problems related to gate matrix layout and PLA folding Computing, Suppl. 7 1990 17 51
34. J. Neetil, and V. Rdl Chromatically optimal rigid graphs Journal of Combinatorial Theory, Series B 46 1989 133 141
35. P.D. Seymour, and R. Thomas Graph searching and a minmax theorem for tree-width Journal of Combinatorial Theory, Series B 58 1993 22 33
36. Cs. Szab, and L. Zdori Idempotent totally symmetric operations on finite posets Order 18 2001 39 47
37. L. Zdori Posets, near-unanimity functions and zigzags Bulletin of the Australian Mathematical Society 47 1993 79 93
38. L. Zdori Monotone Jnsson operations and near unanimity functions Algebra Universalis 33 2 1995 216 236