Sciweavers

6 search results - page 1 / 2
» Caterpillar Duality for Constraint Satisfaction Problems
Sort
View
LICS
2008
IEEE
13 years 11 months ago
Caterpillar Duality for Constraint Satisfaction Problems
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems ...
Catarina Carvalho, Víctor Dalmau, Andrei A....
DAGSTUHL
2008
13 years 6 months ago
Dualities for Constraint Satisfaction Problems
In a nutshell, a duality for a constraint satisfaction problem equates the existence of one homomorphism to the non-existence of other homomorphisms. In this survey paper, we give ...
Andrei A. Bulatov, Andrei A. Krokhin, Benoit Laros...
LICS
2012
IEEE
11 years 7 months ago
Near Unanimity Constraints Have Bounded Pathwidth Duality
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
Libor Barto, Marcin Kozik, Ross Willard
EJC
2008
13 years 4 months ago
Majority constraints have bounded pathwidth duality
We study certain constraint satisfaction problems which are the problems of deciding whether there exists a homomorphism from a given relational structure to a fixed structure with...
Víctor Dalmau, Andrei A. Krokhin
TCS
2010
13 years 3 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....