A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a
fixed template is that pp-interpretations between at most countable ω-categorical relational …

We introduce the novel machinery of smooth approximations to provide a systematic
algebraic approach to the complexity of CSPs over finitely bounded homogeneous …

The tractability conjecture for finite domain constraint satisfaction problems (CSPs) stated
that such CSPs are solvable in polynomial time whenever there is no natural reduction, in …

We prove that an ω-categorical core structure primitively positively interprets all finite
structures with parameters if and only if some stabilizer of its polymorphism clone has a …

We consider the problem of satisfiability of sets of constraints in a given set of finite uniform
hypergraphs. While the problem under consideration is similar in nature to the problem of …

A constraint satisfaction problem (CSP) is a computational problem where the input consists
of a finite set of variables and a finite set of constraints, and where the task is to decide …

We introduce the novel machinery of smooth approximations, and apply it to confirm the
CSP dichotomy conjecture for first-order reducts of the random tournament, and to give new …

There exist two conjectures for constraint satisfaction problems (CSPs) of reducts of finitely
bounded homogeneous structures: the first one states that tractability of the CSP of such a …

The logic MMSNP is a restricted fragment of existential second-order logic which can
express many interesting queries in graph theory and finite model theory. The logic was …

For n≧3, let (H_n,E) denote the n th Henson graph, ie, the unique countable homogeneous
graph with exactly those finite graphs as induced subgraphs that do not embed the complete …