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}
}
  • Peter Jeavons, D. Cohen, Justin Pearson
  • Published 2004
  • Mathematics, Computer Science
  • Annals of Mathematics and Artificial Intelligence
  • 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

    Figures and Topics from this paper

    Classifying the Complexity of Constraints Using Finite Algebras
    • 541
    • PDF
    The complexity of soft constraint satisfaction
    • 135
    • PDF
    A dichotomy theorem for constraints on a three-element set
    • A. A. Bulatov
    • Mathematics, Computer Science
    • The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
    • 2002
    • 194
    Complexity of conservative constraint satisfaction problems
    • 134
    • PDF
    Tractable conservative constraint satisfaction problems
    • A. A. Bulatov
    • Mathematics, Computer Science
    • 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
    • 2003
    • 249
    A dichotomy theorem for constraint satisfaction problems on a 3-element set
    • 316
    Dichotomies for classes of homomorphism problems involving unary functions
    • 31
    • PDF

    References

    SHOWING 1-10 OF 25 REFERENCES
    Closure properties of constraints
    • 480
    On binary constraint problems
    • 228
    On the Algebraic Structure of Combinatorial Problems
    • Peter Jeavons
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 1998
    • 359
    • PDF
    Derivation of Constraints and Database Relations
    • 10
    How to Determine the Expressive Power of Constraints
    • 52
    A test for Tractability
    • 41
    Networks of constraints: Fundamental properties and applications to picture processing
    • 1,529
    • Highly Influential
    Constraints, Consistency and Closure
    • 209
    • PDF
    Computers and Intractability: A Guide to the Theory of NP-Completeness
    • 47,264
    • Highly Influential
    • PDF