Parallel and distributed algorithms for finite constraint satisfaction problems

Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991

Volumn , Issue , 1991, Pages 394-397

  Zhang, Ying ^a   MacKworth, A K ^a,b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b CANADIAN INSTITUTE FOR ADVANCED RESEARCH   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS;

CONSTRAINT NETWORKS; DISTRIBUTED COMPUTING NETWORKS; EREW PRAM; FINITE CONSTRAINTS; PARALLEL AND DISTRIBUTED ALGORITHMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 0042549190     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPDP.1991.218214     Document Type: Conference Paper

References (13)

1. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka. A simple parallel tree contraction algorithm. Journal of Algorithms, 10:287-302, 1989.
2. Ft. Dechter. Constraint networks: A survey. In S. Shapiro, editor, Encyclopedia of Artificial Intelligence. Wiley, N. Y., 1991. (to appear).
3. Rina Dechter and Judea Pearl. Tree clustering for constraint networks. Artificial Intelligence, 38(3):257-388, April 1989.
4. E. C. Freuder. Synthesizing constraint expressions. Communications of the ACM, 21(11), November 1978.
5. S. Kasif and A. L. Delcher. Analysis of local consistency in parallel constraint satisfaction networks. In Proc. AAAI Symposium on Constraint Based Reasoning, Stanford, pages 154-163, 1991.
6. A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99-118, 1977.
7. A. K. Mackworth. Constraint satisfaction. In S. Shapiro, editor, Encyclopedia of Artificial Intelligence, pages 205-211. Wiley, N. Y., 1987.
8. A. K. Mackworth and E. C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25(1):65-74, 1985.
9. D. Maier. The Theory of Relational Databases. Computer Science Press, 1983.
10. G. L. Miller and J. H. Reif. Parallel tree contraction and its application. In Proc. 26th Annual IEEE Symp. on Foundations of Comp. Sci., pages 478-489, 1985.
11. U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Information Science, 7:95-132, 1974.
12. G. Shafer and P. P. Shenoy. Local computation in hypertrees. Technical report, School of Business, University of Kansas, August 1988. Working paper 201.
13. Ying Zhang and Alan K. Mackworth. Parallel and distributed algorithms for constraint networks. Technical Report 91-6, Department of Computer Science, Univ. of British Columbia, May 1991.