# Constraint Satisfaction with Countable Homogeneous Templates

@article{Bodirsky2006ConstraintSW,
title={Constraint Satisfaction with Countable Homogeneous Templates},
author={Manuel Bodirsky and Jaroslav Nesetril},
journal={J. Log. Comput.},
year={2006},
volume={16},
pages={359-373}
}
• Published 2006
• Computer Science, Mathematics
• J. Log. Comput.
For a fixed countable homogeneous relational structure Γ we study the computational problem whether a given finite structure of the same signature homomorphically maps to Γ. This problem is known as the constraint satisfaction problem CSP(Γ) for the template Γ and has been intensively studied for finite Γ. We show that --- as in the case of finite Γ --- the computational complexity of CSP(Γ) for countable homogeneous Γ is determined by the clone of polymorphisms of Γ. To this end we prove the… Expand

#### Figures and Topics from this paper

Distance constraint satisfaction problems
• Computer Science, Mathematics
• Inf. Comput.
• 2016
This work provides a full classification of templates Γ that are first-order definable in (Z; succ), the integers with the successor relation to show that one of the following is true: the structure Γ is homomorphically equivalent to a structure with a certain majority polymorphism and CSP(Γ) can be solved in polynomial time. Expand
Constraint satisfaction with infinite domains
Omega-categoricity is a rather strong model-theoretic assumption on a relational structure, and it can be used to show that many techniques for constraint satisfaction with finite templates extend to omega- categorical templates. 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
Decidability of Definability
• Mathematics
• The Journal of Symbolic Logic
• 2013
Abstract For a fixed countably infinite structure Γ with finite relational signature τ, we study the following computational problem: input are quantifier-free τ-formulas ϕ 0, ϕ 1, …, ϕ n that defineExpand
Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction
• Mathematics, Computer Science
• J. Log. Comput.
• 2012
The results imply that several families of constraint satisfaction problems exhibit a complexity dichotomy: the problems are either polynomial-time solvable or NP-hard depending on the choice of the allowed relations. Expand
Ω-categorical Structures Avoiding Height 1 Identities
• Mathematics, Computer Science
• ArXiv
• 2020
It is shown that local satisfaction and global satisfaction of non-trivial height 1 identities differ for $\omega$-categorical structures with less than doubly exponential orbit growth, thereby resolving one of the main open problems in the algebraic theory of such structures. Expand
The wonderland of reflections
• Mathematics, Computer Science
• ArXiv
• 2015
A new elegant dichotomy conjecture for the CSPs of reducts of finitely bounded homogeneous structures is formulated and a close connection between h1 clone homomorphisms and the notion of compatibility with projections used in the study of the lattice of interpretability types of varieties is revealed. 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
Locally Finite Constraint Satisfaction Problems
• Computer Science, Mathematics
• 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
• 2015
This work argues that locally finite templates, which contain potentially infinitely many finite relations, occur naturally in Descriptive Complexity Theory, and studies CSPs over such templates for both finite and infinite, definable instances. Expand

#### References

SHOWING 1-10 OF 51 REFERENCES
Constraint Satisfaction with Countable Homogeneous Templates
• Mathematics, Computer Science
• CSL
• 2003
The primitive positive definable relations over an ω-categorical structure Γ are precisely the relations that are invariant under the polymorphisms of Γ, which shows that the computational complexity of CSP(Γ) for countable homogeneous Γ is determinded by the clone of polymorphisms. Expand
The Core of a Countably Categorical Structure
It is shown that if Γ contains all primitive positive definable relations, then the core of Γ admits quantifier elimination, and it is proved that every ω-categorical structure has a core, which is unique up to isomorphism, and which is againω- categorical. Expand
Classifying the Complexity of Constraints Using Finite Algebras
• Mathematics, Computer Science
• SIAM J. Comput.
• 2005
It is shown that any set of relations used to specify the allowed forms of constraints can be associated with a finite universal algebra and how the computational complexity of the corresponding constraint satisfaction problem is connected to the properties of this algebra is explored. Expand
A dichotomy theorem for constraints on a three-element set
• A. Bulatov
• Mathematics, Computer Science
• The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
• 2002
Every subclass of the CSP defined by a set of allowed constraints is either tractable or NP-complete, and the criterion separating them is that conjectured by Bulatov et al. (2001). Expand
The complexity of maximal constraint languages
• Mathematics, Computer Science
• STOC '01
• 2001
This paper systematically study the complexity of all maximal constraint languages, that is, languages whose expressive power is just weaker than that of the language of all constraints. 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
Homogeneous Directed Graphs
This is the first case in which an uncountable collection of structures is handled by methods devised by Lachlan and Woodrow and applied by them to the case of homogeneous undirected graphs, and by Lacheslan to the cases of tournaments. Expand
A new tractable class of constraint satisfaction problems
• V. Dalmau
• Mathematics, Computer Science
• Annals of Mathematics and Artificial Intelligence
• 2005
A new class of problems called para-primal problems, incomparable with the families identified by Feder and Vardi (1998), is introduced and it is proved that any constraint problem in this class is decidable in polynomial time. 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
Tractable conservative constraint satisfaction problems
• A. Bulatov
• Mathematics, Computer Science
• 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
• 2003
This work completely characterize conservative constraint languages that give rise to CSP classes solvable in polynomial time, and obtains a complete description of those (directed) graphs H for which the List H-Coloring problem is poynomial time solvable. Expand