LICS
2012
IEEE
12 years 5 months ago
2012
IEEE
—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...
DM
2010
14 years 2 months ago
2010
Jarik Nesetril suggested to the first author the investigation of notions of homogeneity for relational structures, where "isomorphism" is replaced by "homomorphism...
LICS
2006
IEEE
14 years 8 months ago
2006
IEEE
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
MFCS
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
ICML
2001
IEEE
15 years 3 months ago
2001
IEEE
Most real-world data is stored in relational form. In contrast, most statistical learning methods work with "flat" data representations, forcing us to convert our data i...