# On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction

@inproceedings{Bodirsky2010OnTS,
title={On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction},
author={Manuel Bodirsky and Martin Hils and Barnaby Martin},
booktitle={LICS},
year={2010}
}
• Published in LICS 2010
• Computer Science
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously been applied to the study of CSPs with finite or (infinite) omega-categorical templates. Our first result is an exact characterization of those CSPs that can be formulated with (a finite or) an omega-categorical template. The universal-algebraic approach relies on the fact that in finite or omega-categorical structures… Expand
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
• Mathematics, Computer Science
• 2010 25th Annual IEEE Symposium on Logic in Computer Science
• 2010
It is proved that every CSP can be formulated with a template A such that a relation is primitive positive definable in A if and only if it is first-order definable on A and preserved by the infinitary polymorphisms of A. Expand
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
AN ALGEBRAIC PRESERVATION THEOREM FOR ℵ0-CATEGORICAL QUANTIFIED CONSTRAINT SATISFACTION
We prove an algebraic preservation theorem for positive Horn definability in @0-categorical structures. In particular, we define and study a construction which we call the periodic power of aExpand
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
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
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
• Mathematics, Computer Science
• 2012 27th Annual IEEE Symposium on Logic in Computer Science
• 2012
The preservation theorem states that, over an aleph-zero categorical structure, a relation is positive Horn definable if and only if it is preserved by all periomorphisms of the structure. Expand
Solving equation systems in ω-categorical algebras
• Mathematics, Computer Science
• 2019
The pseudo-Siggers identity has been used to prove a complexity dichotomy for the first time, and if $\mathfrak{A}$ is an $\omega$-categorical semilattice or an abelian group, then the problem is in P or NP-hard. 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
A finer reduction of constraint problems to digraphs
• Mathematics, Computer Science
• Log. Methods Comput. Sci.
• 2015
The Algebraic CSP dichotomy conjecture as well as the conjectures characterizing CSPs solvable in logspace and in nondeterministic logspace are equivalent to their restriction to digraphs. Expand

#### References

SHOWING 1-10 OF 28 REFERENCES
Non-dichotomies in Constraint Satisfaction Complexity
• Mathematics, Computer Science
• ICALP
• 2008
It is shown that every computational decision problem is polynomial-time equivalent to a constraint satisfaction problem (CSP) with an infinite template and that if the so-called local-global conjecture for infinite constraint languages(over a finite domain) is false, then there is no dichotomy for the constraints satisfaction problem for infinite constraints languages. 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
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
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
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Every subproblem of the CSP is either tractable or NP-complete, and the criterion separating them is that conjectured in Bulatov et al. 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
CLOSED SYSTEMS OF FUNCTIONS AND PREDICATES
In this paper we show that there is a one to one correspondence between systems of functions defined on a finite set A and systems of predicates defined on A. This result implies that a complete setExpand
Maximal infinite-valued constraint languages
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2009
A generalization of the well-established notion of maximal constraint languages from finite to infinite domains, which is in one-to-one correspondence to minimal oligomorphic clones, is studied. 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
Closure properties of constraints
• Mathematics, Computer Science
• JACM
• 1997
This paper investigates the subclasses that arise from restricting the possible constraint types, and shows that any set of constraints that does not give rise to an NP-complete class of problems must satisfy a certain type of algebraic closure condition. Expand