Constraints and universal algebra

Annals of Mathematics and Artificial Intelligence

Volumn 24, Issue 1-4, 1998, Pages 51-67

  Jeavons, Peter ^b   Cohen, David ^b   Pearson, Justin ^a  

^a UPPSALA UNIVERSITY   (Sweden)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032243573     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018941030227     Document Type: Article

References (19)

1. K.A. Baker and A.F. Pixley, Polynomial interpolation and the chinese remainder theorem, Math. Z. 143 (1975) 165-174.
2. D.A. Cohen, M. Gyssens and P.G. Jeavons, Derivation of constraints and database relations, in: Proceedings 2nd International Conference on Constraint Programming - CP '96, Boston (August 1996), Lecture Notes in Computer Science, Vol. 1118 (Springer, New York, 1996) pp. 134-148.
3. P.M. Cohn, Universal Algebra (Harper & Row, 1965).
4. M. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
5. M. Gyssens, P.G. Jeavons and D.A. Cohen, Decomposing constraint satisfaction problems using database techniques, Artif. Intell. 66(1) (1994) 57-89.
6. T. Ihringer and R. Pöschel, Collapsing clones, Acta Sci. Math. (Szeged) 58 (1993) 99-113.
7. P. Jeavons, On the algebraic structure of combinatorial problems, Theoret. Comput. Sci. 200 (1998) 185-204.
8. P.G. Jeavons, D.A. Cohen and M.C. Cooper, Constraints, consistency and closure, Artif. Intell. 101 (1998) 251-265.
9. P.G. Jeavons, D.A. Cohen and M. Gyssens, A unifying framework for tractable constraints, in: Proceedings 1st International Conference on Constraint Programming - CP'95, Cassis, France, (September 1995), Lecture Notes in Computer Science, Vol. 976 (Springer, New York, 1995) pp. 276-291.
10. P.G. Jeavons, D.A. Cohen and M. Gyssens, A test for tractability, in: Proceedings 2nd International Conference on Constraint Programming - CP'96, Boston (August 1996), Lecture Notes in Computer Science, Vol. 1118 (Springer, New York, 1996) pp. 267-281.
11. P.G. Jeavons, D.A. Cohen and M. Gyssens, Closure properties of constraints, J. ACM 44 (1997) 527-548.
12. P.G. Jeavons, D.A. Cohen and M. Gyssens, How to determine the expressive power of constraints, Constraints (1998, to appear).
13. P.B. Ladkin and R.D. Maddux, On binary constraint problems, J. ACM 41 (1994) 435-469.
14. A.K. Mackworth, Consistency in networks of relations, Artif. Intell. 8 (1977) 99-118.
15. R.N. McKenzie, G.F. McNulty and W.F. Taylor, Algebras, Lattices and Varieties, Vol. 1 (Wadsworth and Brooks, CA, 1987).
16. U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Inform. Sci. 7 (1974) 95-132.
17. C.H. Papadimitriou, Computational Complexity (Addison-Wesley, Reading, MA, 1994).
18. E.L. Post, The Two-Valued Iterative Systems of Mathematical Logic, Annals of Mathematical Studies, Vol. 5 (Princeton University Press, Princeton, 1941).
19. A. Szendrei, Clones in Universal Algebra, Seminaires de Mathematiques Superieures, Vol. 99 (University of Montreal, Montreal, 1986).