# Constraint satisfaction with infinite domains

@inproceedings{Bodirsky2004ConstraintSW, title={Constraint satisfaction with infinite domains}, author={Manuel Bodirsky}, year={2004} }

Many constraint satisfaction problems have a natural formulation as a homomorphism problem. For a fixed relational structure Gamma we consider the following computational problem: Given a structure S with the same relational signature as Gamma, is there a homomorphism from S to Gamma? This problem is known as the constraint satisfaction problem CSP(Gamma) for the so-called template Gamma and is intensively studied for relational structures Gamma with a finite domain. However, many constraint… Expand

#### Figures, Tables, and Topics from this paper

figure 1.1 figure 1.2 figure 1.3 figure 1.4 figure 2.2 figure 2.3 figure 2.4 figure 2.5 figure 2.6 figure 3.1 figure 3.2 figure 3.3 figure 3.4 figure 3.5 figure 5.1 figure 5.2 figure 5.3 figure 5.5 figure 6.1 figure 6.10 table 6.1 figure 6.11 figure 6.12 figure 6.13 figure 6.2 figure 6.3 figure 6.5 figure 6.6 figure 6.7 figure 6.8 figure 6.9

#### 41 Citations

Complexity Classification in Infinite-Domain Constraint Satisfaction

- Mathematics, Computer Science
- ArXiv
- 2012

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

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

- Computer Science
- LICS
- 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

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

The Core of a Countably Categorical Structure

- Mathematics, Computer Science
- STACS
- 2005

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

The Complexity of Equality Constraint Languages

- Mathematics, Computer Science
- Theory of Computing Systems
- 2007

This work applies the universal-algebraic approach to infinite-valued constraint satisfaction, and shows that an equality constraint language is tractable if it admits a constant unary polymorphism or an injective binary polymorphism, and is NP-complete otherwise. Expand

The Complexity of Equality Constraint Languages

- Mathematics, Computer Science
- CSR
- 2006

The algebraic approach to infinite-valued constraint satisfaction is applied to classify the computational complexity of all constraint satisfaction problems with templates that have a highly transitive automorphism group and shows that an equality constraint language is tractable if it admits a constant unary or an injective binary polymorphism and is NP-complete otherwise. Expand

Complexity of Infinite-Domain Constraint Satisfaction

- Computer Science
- 2021

This monograph presents a self-contained introduction to the universal-algebraic approach to complexity classification, treating both finite and infinite-domain CSPs. Expand

Approximation for Maximum Surjective Constraint Satisfaction Problems

- Mathematics, Computer Science
- ArXiv
- 2011

This work gives a complexity dichotomy for Max-Sur-CSP(B) between PTAS and APX-complete, under the assumption that there is a complexity duality between PO and APx-complete. Expand

Approximability of Clausal Constraints

- Mathematics, Computer Science
- Theory of Computing Systems
- 2008

This work gives sufficient conditions for when such problems are polynomial-time solvable and it is proved that they are APX-hard otherwise. Expand

Transformations of representation in constraint satisfaction

- Mathematics, Computer Science
- Constraints
- 2015

It is shown how the microstructure can be used to define CSPs that are tractable because their clause structures fall within classes of graphs for which an independent set of specified size can be found efficiently. Expand

#### References

SHOWING 1-10 OF 157 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

Constraint Satisfaction Problems and Finite Algebras

- Mathematics, Computer Science
- ICALP
- 2000

It is shown that any restricted set of constraint types can be associated with a finite universal algebra and the result is a dichotomy theorem which significantly generalises Schaefer's dichotomy for the Generalised Satisfiability problem. Expand

Monotone monadic SNP and constraint satisfaction

- Computer Science
- STOC '93
- 1993

The question whether every problem in CSP is either in P or is NP-complete is posed, and the class of constraint-satisfaction problems with respect to fixed templates is defined. 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

Quantified Constraints: Algorithms and Complexity

- Computer Science
- CSL
- 2003

This paper considers a more general framework for constraint satisfaction problems which allows arbitrary quantifiers over constrained variables, rather than just existential quantifiers, and shows that the complexity of such extended problems is determined by the surjective polymorphisms of the constraint predicates. Expand

Tractable conservative constraint satisfaction problems

- 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

Dichotomies for classes of homomorphism problems involving unary functions

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2004

A dichotomy result is established for the class of non-uniform constraint satisfaction problems where the template is a λ2-structure with the property that the two unary functions involved are the reverse of one another, in that every such problem is either solvable in polynomial-time or NP-complete. Expand

Conjunctive-query containment and constraint satisfaction

- Computer Science, Mathematics
- PODS '98
- 1998

This paper examines the tractable cases of Boolean constraint-satisfaction problems and shows that they do uniformize, and exhibits three nonuniform tractability results that uniformize and give rise to polynomial-time solvable cases of constraint satisfaction and conjunctive-query containment. Expand

A dichotomy theorem for constraints on a three-element set

- 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