Constraint satisfaction is where AI, universal algebra, computational complexity, graph theory, finite model theory, and group theory all overlap. Maybe we can shoehorn topology and ergodic theory in there, too…
In 2014 I completed a doctorate in computer science at the University of Oxford. In my thesis Transformations of representations in constraint satisfaction, I tackled some of these connections to study hybrid tractability of constraint satisfaction. See András Salamon at Google Scholar for my papers. My old academic homepage was András Salamon at Oxford Computer Science.
Constraints 
Leave a comment