# Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property

@article{Bodirsky2021CanonicalPO,
title={Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property},
author={M. Bodirsky and Bertalan Bodor},
journal={2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
year={2021},
pages={1-13}
}
• Published 2021
• Computer Science, Mathematics
• 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Constraint satisfaction problems for first-order reducts of finitely bounded homogeneous structures form a large class of computational problems that might exhibit a complexity dichotomy, P versus NP-complete. A powerful method to obtain polynomial-time tractability results for such CSPs is a certain reduction to polynomial-time tractable finite-domain CSPs de-fined over k-types, for a sufficiently large k. We give sufficient conditions when this method can be applied and illustrate how to use… Expand
2 Citations

#### Tables from this paper

Classification of $\omega$-categorical monadically stable structures
A first-order structure $\mathfrak{A}$ is called monadically stable iff every expansion of $\mathfrak{A}$ by unary predicates is stable. In this article we give a classification of the classExpand
Smooth approximations and CSPs over finitely bounded homogeneous structures
• Mathematics, Computer Science
• ArXiv
• 2020
We develop the novel machinery of smooth approximations, and apply it to confirm the CSP dichotomy conjecture for first-order reducts of the random tournament, various homogeneous graphs includingExpand

#### References

SHOWING 1-10 OF 53 REFERENCES
A Dichotomy for First-Order Reducts of Unary Structures
• Mathematics, Computer Science
• Log. Methods Comput. Sci.
• 2018
This work uses a general polynomial-time reduction from such infinite-domain CSPs to finite- domains to obtain new powerful polynometric-time tractability conditions that can be expressed in terms of the topological polymorphism clone of A. Expand
The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems
• Mathematics, Computer Science
• 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
• 2017
T tractability of the CSP of a reducts of finitely bounded homogeneous structures is equivalent to the linear identities satisfied by its polymorphisms clone, together with the natural uniformity on it, being non-trivial. Expand
Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
• Computer Science, Mathematics
• 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
• 2016
This paper shows that the tractability conjecture for reducts of finitely bounded homogeneous structures is for $\mathcal{C}$ equivalent to the finite-domain tractable conjecture, and studies the subclass of CSPs for structures that are first-order definable over equality with parameters. Expand
Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
• Mathematics, Computer Science
• Log. Methods Comput. Sci.
• 2012
Two new characterizations of finitely generated Taylor varieties are provided using absorbing subalgebras and cyclic terms, allowing to reprove the conjecture of Bang-Jensen and Hell and the characterization of locally finite Taylor varieties using weak near- unanimity terms in an elementary and self-contained way. Expand
A Proof of CSP Dichotomy Conjecture
• Dmitriy Zhuk
• Computer Science, Mathematics
• 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
• 2017
An algorithm is presented that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture. Expand
Equations in oligomorphic clones and the Constraint Satisfaction Problem for $ω$-categorical structures
• Mathematics, Computer Science
• J. Math. Log.
• 2019
It is proved that any polymorphism of sufficiently large arity which is totally symmetric modulo outer embeddings of a finitely bounded structure can be turned into a non-trivial system of linear identities, and obtain non-Trivial linear identities for all tractable cases of reducts of the rational order, the random graph, and the random poset. Expand
Complexity of Infinite-Domain Constraint Satisfaction
This monograph presents a self-contained introduction to the universal-algebraic approach to complexity classification, treating both finite and infinite-domain CSPs. Expand
The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
• Computer Science, Mathematics
• 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
• 2016
We prove that an ω-categorical core structure primitively positively interprets all finite structures with parameters if and only if some stabilizer of its polymorphism clone has a homomorphism toExpand
A Dichotomy Theorem for Nonuniform CSPs
• A. Bulatov
• Mathematics, Computer Science
• 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
• 2017
The Dichotomy Conjecture for the non-uniform CSP states that for every constraint language \Gm the problem CSP is either solvable in polynomial time or is NP-complete. Expand
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Mathematics, Computer Science
• SIAM J. Comput.
• 1998
This paper isolates a class (of problems specified by) "monotone monadic SNP without inequality" which may exhibit a dichotomy, and explains the placing of all these restrictions by showing, essentially using Ladner's theorem, that classes obtained by using only two of the above three restrictions do not show this dichotomy. Expand