Closure properties of constraints

Journal of the ACM

Volumn 44, Issue 4, 1997, Pages 527-548

  Jeavons, Peter ^a   Cohen, David ^a   Gyssens, Marc ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b HASSELT UNIVERSITY   (Belgium)

Author keywords

Algorithms; Complexity; Constraint satisfaction problem; Indicator problem; Languages; NP completeness; Theory; Verification

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FORMAL LOGIC; PROBLEM SOLVING;

ALGEBRAIC CLOSURE CONDITIONS; CONSTRAINT SATISFACTION PROBLEMS;

CONSTRAINT THEORY;

EID: 0031176779     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/263867.263489     Document Type: Article

References (29)

1. CODD, E. F. 1970. A relational model of data for large shared data banks. Commun. ACM 13, 6 (June), 377-387.
2. COHEN, D., GYSSENS, M., AND JEAVONS, P. 1996. Derivation of constraints and database relations. In Proceedings of the 2nd International Conference on Constraint Programming-CP '96 (Boston, Mass., Aug.). Lecture Notes in Computer Science, 1118. Springer-Verlag, New York, pp. 134-148.
3. COHN, P. M. 1965. Universal Algebra. Harper & Row, New York.
4. COOPER, M. C., COHEN, D. A. AND JEAVONS, P. G. 1994. Characterizing tractable constraints. Artif. Int. 65, 347-361.
5. DECHTER, R. 1992. From local to global consistency. Artif. Int. 55, 87-107.
6. DECHTER, R., AND PEARL, J. 1988. Network-based heuristics for constraint-satisfaction problems. Artif. Int. 34, 1-38.
7. DECHTER, R., AND PEARL, J. 1992. Structure identification in relational data. Artif. Int. 58, 237-270.
8. FEDER, T., AND VARDI, M. 1993. Monotone monadic SNP and constraint satisfaction. In Proceedings of the 25th ACM Symposium on the Theory of Computing (STOC) (San Diego, Calif., May 16-18). ACM, New York, pp. 612-622.
9. FREUDER, E. C. 1985. A sufficient condition for backtrack-bounded search. J. ACM 32, 4 (Oct.), 755-761.
10. FREUDER, E. C. 1991. Eliminating interchangeable values in constraint satisfaction problems. In Proceedings of AAAI-91. pp. 227-233.
11. GAREY, M. R., AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, Calif.
12. GYSSENS, M., JEAVONS, P., AND COHEN, D. 1994. Decomposing constraint satisfaction problems using database techniques. Artif. Int. 66, 57-89.
13. JEAVONS, P. G. 1995. An algebraic characterization of tractable constraints. Tech. Rep. CSD-TR-95-05. Royal Holloway, Univ. London, London, United Kingdom.
14. JEAVONS, P., COHEN, D., AND GYSSENS, M. 1995. A unifying framework for tractable constraints. In Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming-CP '95 (Cassis, France, Sept.). Lecture Notes in Computer Science, vol. 976. Springer-Verlag, New York, pp. 276-291.
15. JEAVONS, P., COHEN, D., AND GYSSENS, M. 1996. A test for tractability. In Proceedings of the 2nd International Conference on Constraint Programming-CP '96 (Boston, Mass., Aug.). Lecture Notes in Computer Science, vol. 1118. Springer-Verlag, New York, pp. 267-281.
16. JEAVONS, P. G., AND COOPER, M. C. 1996. Tractable constraints on ordered domains. Artif. Int. 79, 327-339.
17. KIROUSIS, L. 1993. Fast parallel constraint satisfaction. Artif. Int. 64, 147-160.
18. LADKIN, P. B., AND MADDUX, R. D. 1994. On binary constraint problems. J. ACM 41, 3 (May), 435-469.
19. MACHIDA, H., AND ROSENBERG, I. G. 1984. Classifying essentially minimal clones. In Proceedings of the 14th International Symposium on Multiple-Valued Logic. (Winnipeg, 1984), pp. 4-7.
20. MACKWORTH, A. K. 1977. Consistency in networks of relations. Artif. Int. 8, 99-118.
21. MCKENZIE, R. N., MCNULTY, G. F., AND TAYLOR, W. F. 1987. Algebras, Lattices and Varieties. Volume I. Wadsworth and Brooks, Calif.
22. MONTANARI, U. 1974. Networks of constraints: Fundamental properties and applications to picture processing. Inf. Sci. 7, 95-132.
23. MONTANARI, U., AND ROOSI, F. 1991. Constraint relaxation may be perfect. Artif. Int. 48, 143-170.
24. PAPADIMITRIOU, C. H. 1994. Computational Complexity, Addison-Wesley, Reading, Pa.
25. ROSENBERG, I. G. 1986. Minimal clones I: The five types. In Lectures in Universal Algebra (Proc. Conf. Szeged 1983), Colloq. Math. Soc. Janos Bolyai, vol. 43. North-Holland, Amsterdam, The Netherlands, pp. 405-427.
26. SCHAEFER, T. J. 1978. The complexity of satisfiability problems. In Proceedings of the 10th ACM Symposium on Theory of Computing (San Diego, Calif., May 1-3). ACM, New York, pp. 216-226.
27. SZENDREI, A. 1986. Clones in Universal Algebra. Seminaires de Mathematiques Superieures 99, University of Montreal, Montreal, Que., Canada.
28. VAN BEEK, P. 1992. On the minimality and decomposability of row-convex constraint networks. In Proceedings of the 10th National Conference on Artificial Intelligence, AAAI-92. MIT Press, Cambridge, Mass., pp. 447-452.
29. VAN HENTENRYCK, P., DEVILLE, Y., AND TENG, C-M. 1992. A generic arc-consistency algorithm and its specializations. Artif. Int. 57, 291-321.