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 …

We investigate structural implications arising from the condition that a given directed graph
does not interpret, in the sense of primitive positive interpretation with parameters or orbits …

A Constraint Satisfaction Problem (CSP) is a computational problem where we are given
variables and constraints about them; the question is whether the variables can be assigned …

We produce a class of ω-categorical structures with finite signature by applying a model-
theoretic construction-a refinement of an encoding due to Hrushosvki-to ω-categorical …

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

Following the success of the so-called algebraic approach to the study of decision constraint
satisfaction problems (CSPs), exact optimization of valued CSPs, and most recently promise …

CORES OVER RAMSEY STRUCTURES §1. Introduction. 1.1. Model-complete cores. A countable
-categorical structure A is model- comple Page 1 The Journal of Symbolic Logic Volume 86 …

A recent result by Bodirsky and Guzmán-Pro gives a complexity dichotomy for the following
class of computational problems, parametrized by a finite family F of finite tournaments …

Finite-domain constraint satisfaction problems are either solvable by Datalog or not even
expressible in fixed-point logic with counting. The border between the two regimes can be …

Two particularly active branches of research in constraint satisfaction are the study of
promise constraint satisfaction problems (PCSPs) with finite templates and the study of …