One of the traditional applications of relation algebras is to provide a setting for infinite-domain constraint satisfaction problems. Complexity classification for these computational problems has been one of the major open research challenges of this application field. The past decade has brought significant progress on the theory of constraint satisfaction, both over finite and infinite domains. This progress has been achieved independently from the relation algebra approach. The present article translates the recent findings into the traditional relation algebra setting, and points out a series of open problems at the interface between model theory and the theory of relation algebras.
Bodirsky, M. (2018). Finite relation algebras with normal representations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11194 LNCS, pp. 3–17). Springer Verlag. https://doi.org/10.1007/978-3-030-02149-8_1