Sciweavers

LICS
2012
IEEE
12 years 1 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
DM
2010
99views more  DM 2010»
13 years 11 months ago
Posets, homomorphisms and homogeneity
Jarik Nesetril suggested to the first author the investigation of notions of homogeneity for relational structures, where "isomorphism" is replaced by "homomorphism...
Peter J. Cameron, Deborah C. Lockett
LICS
2006
IEEE
14 years 5 months ago
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems
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....
Dietrich Kuske, Markus Lohrey
MFCS
2007
Springer
14 years 5 months ago
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
Jaroslav Nesetril, Mark H. Siggers
ICML
2001
IEEE
15 years 6 hour ago
Learning Probabilistic Models of Relational Structure
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...
Lise Getoor, Nir Friedman, Daphne Koller, Benjamin...