A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Equations in oligomorphic clones and the Constraint Satisfaction Problem for ω-categorical structures
[article]
2018
arXiv
pre-print
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 structure is, when the structure is a model-complete core, equivalent to its polymorphism clone satisfying a certain non-trivial linear identity modulo outer embeddings. The second conjecture, challenging the approach via model-complete cores by reflections, states that tractability is equivalent to the linear
arXiv:1612.07551v3
fatcat:nipnkh3cj5fsxezuqcmvuwjxwi