Sciweavers

133
Voted
TCS
2010
15 years 1 months ago
CSP duality and trees of bounded pathwidth
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
Catarina Carvalho, Víctor Dalmau, Andrei A....
113
Voted
DAGSTUHL
2008
15 years 5 months ago
Constraint Satisfaction Problems with Infinite Templates
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
Manuel Bodirsky
117
Voted
FOCS
2009
IEEE
15 years 10 months ago
Constraint Satisfaction Problems of Bounded Width
We provide a full characterization of applicability of The Local Consistency Checking algorithm to solving the non-uniform Constraint Satisfaction Problems. This settles the conje...
Libor Barto, Marcin Kozik