Constraints and universal algebra
@article{Jeavons2004ConstraintsAU, title={Constraints and universal algebra}, author={Peter Jeavons and D. Cohen and Justin Pearson}, journal={Annals of Mathematics and Artificial Intelligence}, year={2004}, volume={24}, pages={51-67} }
In this paper we explore the links between constraint satisfaction problems and universal algebra. We show that a constraint satisfaction problem instance can be viewed as a pair of relational structures, and the solutions to the problem are then the structure preserving mappings between these two relational structures. We give a number of examples to illustrate how this framework can be used to express a wide variety of combinatorial problems, many of which are not generally considered as… CONTINUE READING
49 Citations
Classifying the Complexity of Constraints Using Finite Algebras
- Mathematics, Computer Science
- SIAM J. Comput.
- 2005
- 541
- PDF
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
- 194
Complexity of conservative constraint satisfaction problems
- Mathematics, Computer Science
- TOCL
- 2011
- 134
- PDF
Tractable conservative constraint satisfaction problems
- Mathematics, Computer Science
- 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
- 2003
- 249
Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms
- Mathematics, Computer Science
- STACS
- 2005
- 15
A dichotomy theorem for constraint satisfaction problems on a 3-element set
- Mathematics, Computer Science
- JACM
- 2006
- 316
Dichotomies for classes of homomorphism problems involving unary functions
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 2004
- 31
- PDF
References
SHOWING 1-10 OF 25 REFERENCES
On the Algebraic Structure of Combinatorial Problems
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 1998
- 359
- PDF
Networks of constraints: Fundamental properties and applications to picture processing
- Computer Science
- Inf. Sci.
- 1974
- 1,529
- Highly Influential
Computers and Intractability: A Guide to the Theory of NP-Completeness
- Computer Science, Mathematics
- 1978
- 47,264
- Highly Influential
- PDF