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 …

Schaefer's theorem is a complexity classification result for so-called Boolean constraint
satisfaction problems: it states that every Boolean constraint satisfaction problem is either …

We prove the Ramsey property for classes of ordered structures with closures and given
local properties. This generalises earlier results: the Nešetřil–Rödl Theorem, the Ramsey …

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 …

It is known that a countable-categorical structure interprets all finite structures primitively
positively if and only if its polymorphism clone maps to the clone of projections on a two …

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 …

This article is concerned with classes of relational structures that are closed under taking
substructures and isomorphism, that have the joint embedding property, and that …

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 …