# Constraint satisfaction problems for reducts of homogeneous graphs

@inproceedings{Bodirsky2016ConstraintSP,
title={Constraint satisfaction problems for reducts of homogeneous graphs},
author={M. Bodirsky and B. Martin and Michael Pinsker and Andr{\'a}s Pongr{\'a}cz},
booktitle={ICALP},
year={2016}
}
For $n\geq 3$, let $(H_n, E)$ denote the $n$-th Henson graph, i.e., the unique countable homogeneous graph with exactly those finite graphs as induced subgraphs that do not embed the complete graph on $n$ vertices. We show that for all structures $\Gamma$ with domain $H_n$ whose relations are first-order definable in $(H_n,E)$ the constraint satisfaction problem for $\Gamma$ is either in P or is NP-complete. We moreover show a similar complexity dichotomy for all structures whose relations are… Expand
24 Citations

#### Figures and Topics from this paper

Network satisfaction for symmetric relation algebras with a flexible atom
• Computer Science, Mathematics
• AAAI
• 2021
This work provides a complete classification for the case that $\bf A$ is symmetric and has a flexible atom; the problem is in this case NP-complete or in P. Expand
Tractable Combinations of Temporal CSPs
• Mathematics, Computer Science
• ArXiv
• 2020
It is proved that if T_1 and T_2 are the theories of temporal structures, i.e., structures where all relations have a first-order definition in $(\mathbb{Q},<)$, then $\mathrm{CSP}(T_1 \cup T-2)$ is in P or NP-complete. Expand
Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width
This work studies the amount of consistency needed to solve CSP for first-order expansions S of countably infinite homogeneous graphs that additionally have bounded strict width, i.e., for which establishing local consistency of an instance of the CSP not only decides if there is a solution but also ensures that every solution may be obtained from a locally consistent instance by greedily assigning values to variables. Expand
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)
• Mathematics, Computer Science
• 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
• 2019
It is shown that local satisfaction and global satisfaction of nontrivial height 1 identities differ for $\omega$ -categorical structures with less than double exponential orbit growth, thereby resolving one of the main open problems in the algebraic theory of such structures. Expand
Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems)
• Computer Science, Mathematics
• ArXiv
• 2019
It is shown that local satisfaction and global satisfaction of non-trivial height 1 identities differ for $\omega$-categorical structures with less than double exponential orbit growth, thereby resolving one of the main open problems in the algebraic theory of such structures. Expand
Complexity of Combinations of Qualitative Constraint Satisfaction Problems
• Mathematics, Computer Science
• IJCAR
• 2018
It is shown that for a large class of $\omega$-categorical theories $T_1, T_2$ the Nelson-Oppen conditions are not only sufficient, but also necessary for polynomial-time tractability of CSP (unless P=NP). Expand
Hardness of Network Satisfaction for Relation Algebras with Normal Representations
• Computer Science, Mathematics
• RAMiCS
• 2020
It is proved that if B has domain size at least three and contains no non-trivial equivalence relations but a symmetric atom a with a forbidden triple, then the network satisfaction problem for A is NP-hard. Expand
M ay 2 01 9 TOPOLOGY IS RELEVANT ( IN A DICHOTOMY CONJECTURE FOR INFINITE-DOMAIN CONSTRAINT SATISFACTION PROBLEMS )
The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractableExpand
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
Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property
• Computer Science, Mathematics
• 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
• 2021
This work gives sufficient conditions when this method can be applied and illustrates how to use the general results to prove a new complexity dichotomy for first-order expansions of the basic relations of the spatial reasoning formalism RCC5. Expand

#### References

SHOWING 1-10 OF 52 REFERENCES
Constraint Satisfaction with Countable Homogeneous Templates
• Computer Science, Mathematics
• J. Log. Comput.
• 2006
It is proved that the primitive positive definable relations over an ω-categorical structure Γ are precisely the relations that are preserved by the polymorphisms of Γ. Expand
Schaefer's Theorem for Graphs
• Computer Science, Mathematics
• J. ACM
• 2015
It is proved that either Ψ is contained in one out of 17 classes of graph formulas and the corresponding problem can be solved in polynomial time, or the problem is NP-complete. Expand
Equivalence Constraint Satisfaction Problems
• Mathematics, Computer Science
• CSL
• 2012
This paper verifies the conjecture for all structures that are definable over an equivalence relation with a countably infinite number of countable infinite classes and implies a complexity dichotomy (into NP-complete and P) for a family of constraint satisfaction problems (CSPs) which are called equivalence constraint satisfactionblems. 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
On the complexity of H-coloring
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 1990
The natural conjecture, formulated in several sources, asserts that the H-coloring problem is NP-complete for any non-bipartite graph H, and a proof of this conjecture is given. Expand
Minimal functions on the random graph
• Mathematics
• 2010
We show that there is a system of 14 non-trivial finitary functions on the random graph with the following properties: Any non-trivial function on the random graph generates one of the functions ofExpand
Decidability of Definability
• Mathematics, Computer Science
• 2011 IEEE 26th Annual Symposium on Logic in Computer Science
• 2011
Decidability of the problem is shown for all structures Gamma that have a first-order definition in an ordered homogeneous structure Delta with a finite language whose age is a Ramsey class and determined by finitely many forbidden substructures. Expand
The complexity of satisfiability problems
An infinite class of satisfiability problems is considered which contains these two particular problems as special cases, and it is shown that every member of this class is either polynomial-time decidable or 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
Complexity Classification in Infinite-Domain Constraint Satisfaction
This thesis studies CSPs where the variables can take values from an infinite domain, and studies the limits of complexity classification, and presents classes of computational problems provably do not exhibit a complexity dichotomy into hard and easy problems. Expand