Constraint tightness and looseness versus local and global consistency

Journal of the ACM

Volumn 44, Issue 4, 1997, Pages 549-566

  Van Beek, Peter ^a   Dechter, Rina ^b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithms; Constraint networks; Constraint satisfaction problems; Constraint based reasoning; Local consistency; Relations; Theory

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER NETWORKS; KNOWLEDGE BASED SYSTEMS; QUERY LANGUAGES;

CONSTRAINT LOOSENESS; CONSTRAINT TIGHTNESS; RELATIONAL CONSISTENCY;

CONSTRAINT THEORY;

EID: 0031175908     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/263867.263499     Document Type: Article

References (30)

1. CHEESEMAN, P., KANEFSKY, B., AND TAYLOR, W. M. 1991. Where the really hard problems are. In Proceedings of the 12th International Joint Conference on Artificial Intelligence (Sydney, Australia). Morgan Kaufmann, San Mateo, Calif., pp. 331-337.
2. COOPER, M. C. 1989. An optimal k-consistency algorithm. Artif. Int. 41, 89-95.
3. COOPER, M. C., COHEN, D. A., AND JEAVONS, P. G. 1994. Characterising tractable constraints. Artif. Int. 65, 347-361.
4. DECHTER, R. 1990. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artif. Int. 41, 273-312.
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. 1989. Tree clustering for constraint networks. Artif. Int. 38, 353-366.
8. DECHTER, R., AND MEIRI, I. 1994. Experimental evaluation of preprocessing techniques in constraint satisfaction problems. Artif. Int. 68, 211-242.
9. DECHTER, R., AND VAN BEEK, P. 1997. Local and global relational consistency. Theoret. Computer Sci. 173, 283-308.
10. FREUDER, E. C. 1978. Synthesizing constraint expressions. Commun. ACM 21, 11 (Nov.), 958-966.
11. FREUDER, E. C. 1982. A sufficient condition for backtrack-free search. J. ACM 29, 24-32.
12. FREUDER, E. C. 1985. A sufficient condition for backtrack-bounded search. J. ACM 32, 4 (Oct.), 755-761.
13. GASCHNIG, J. 1978. Experimental case studies of backtrack vs. waltz-type vs. new algorithms for satisfying assignment problems. In Proceedings of the 2nd Canadian Conference on Artificial Intelligence (Toronto, Ont., Canada), pp. 268-277.
14. HARALICK, R. M., AND ELLIOTT, G. L. 1980. Increasing tree search efficiency for constraint satisfaction problems. Artif. Int. 14, 263-313.
15. JEAVONS, P., COHEN, D., AND GYSSENS, M. 1996. A test for tractability. In Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming (Cambridge, Mass.). Lecture Notes in Computer Science, vol. 1118. Springer-Verlag, New York, pp. 267-281.
16. KIROUSIS, L. M. 1993. Fast parallel constraint satisfaction. Artif. Int. 64, 147-160.
17. MACKWORTH, A. K. 1977. Consistency in networks of relations. Artif. Int. 8, 99-118.
18. MACKWORTH, A. K. 1987. Constraint satisfaction. In Encyclopedia of Artificial Intelligence, S. C. Shapiro, ed. Wiley, New York.
19. MACKWORTH, A. K. 1992. The logic of constraint satisfaction. Artif. Int. 58, 3-20.
20. MINTON, S., JOHNSTON, M. D., PHILIPS, A. B., AND LAIRD, P. 1990. Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. In Proceedings of the 8th National Conference on Artificial Intelligence (Boston, Mass.). AAAI Press/The MIT Press, Cambridge, Mass., pp. 17-24.
21. MONTANARI, U. 1974. Networks of constraints: Fundamental properties and applications to picture processing. Inform. Sci. 7, 95-132.
22. NADEL, B. A. 1989. Constraint satisfaction algorithms. Computat. Int. 5, 188-224.
23. PROSSER, P. 1993. Hybrid algorithms for the constraint satisfaction problem. Computat. Int. 9, 268-299.
24. SEIDEL, R. 1983/1987. On the complexity of achieving k-consistency. Department of Computer Science Tech. Rep. 83-4. University of British Columbia, British Columbia, Canada. Cited in: A. K. Mackworth 1987.
25. TSANG, E. 1993. Foundations of Constraint Satisfaction. Academic Press, Orlando, Fla.
26. ULLMAN, J. D. 1988. Principles of Database and Knowledge-Base Systems. Vol. 1. Computer Science Press, Rockville, Md.
27. VAN BEEK, P. 1994. On the inherent level of local consistency in constraint networks. In Proceedings of the 12th National Conference on Artificial Intelligence (Seattle, Wash.). AAAI Press/The MIT Press, Cambridge, Mass., pp. 368-373.
28. VAN BEEK, P., AND DECHTER, R. 1994. Constraint tightness versus global consistency. In Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (Bonn, Germany). Morgan Kaufmann, San Mateo, Calif., pp. 572-582.
29. VAN BEEK, P., AND DECHTER, R. 1995. On the minimality and global consistency of row-convex constraint networks. J. ACM 42, 3 (May), 543-561.
30. WILLIAMS, C. P., AND HOGG, T. 1992. Using deep structure to locate hard problems. In Proceedings of the 10th National Conference on Artificial Intelligence (San Jose, Calif.). AAAI Press/ The MIT Press, Cambridge, Mass., pp. 472-477.