Abstract
A constraint network is arc consistent if any value of any of its variables is compatible with at least one value of any other variable. The Arc Consistency Problem (ACP) consists in filtering out values of the variables of a given network to obtain one that is arc consistent, without eliminating any solution. ACP is known to be inherently sequential, or P-complete, so in this paper we examine some weaker versions of it and their parallel complexity. We propose several natural approximation schemes for ACP and show that they are also P-complete. In an attempt to overcome these negative results, we turn our attention to the problem of filtering out values from the variables so that each value in the resulting network is compatible with at least one value of not necessarily all, but a constant fraction of the other variables. We call such a network partially arc consistent. We give a parallel algorithm that, for any constraint network, outputs a partially arc consistent subnetwork of it in sublinear ( O(\(\sqrt n\)logn)) parallel time using O(n2) processors. This is the first (to our knowledge) sublinear-time parallel algorithm with polynomially many processors that guarantees that in the resulting network every value is compatible with at least one value in at least a constant fraction of the remaining variables. Finally, we generalize the notion of partiality to the k-consistency problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anderson, R. and Mayr, E. (1987). Parallelism and greedy algorithms. Advances in Computing Recearch 4: 17-38. See also: A P-complete problem and approximations to it, Technical Report, Dept. Computer Science, Stanford University, California (1984).
Bessiere, C. (1994). Arc-consistency and arc-consistency again. Artificial Intelligence 65: 179-190.
Cohen, D. A., Cooper, M. C., and Jeavons, P. G. (1994). Characterizing tractable constraints. Artificial Intelligence 65: 347-361.
Cooper, M. C. (1990). An optimal k-consistency algorithm. Artificial Intelligence 41: 89-95.
Cooper, P. R., and Swain, M. J. (1992). Arc consistency: parallelism and domain dependence. Artificial Intelligence 58: 207-235.
Dechter, R. (1992). Constraint networks. In S. Shapiro, editor, Encyclopedia of Artificial Intelligence, 2nd ed., pages 276-285, Wiley, New York.
Dechter, R. and Meiri, I. (1994). Experimental results of preprocessing algorithms for constraint satisfaction problems. Artificial Intelligence 68: 211-241.
Dechter, R. and Pearl, J. Tree clustering for constraint networks. Artificial Intelligence 38: 353-366.
Dendris, N. D., Kalafatis, I. A., and Kirousis, L. M. (1994). An efficient parallel algortihm for geometrically characterising drawings of a class of 3-D objects. Journal of Mathematical Imaging and Vision 4: 375-387.
Dendris, N. D., Kirousis, L. M., Stamatiou, Y. C, and Thilikos, D. M. Partiality and approximation schemes for local consistency in networks of constraints. In P. S. Thiagarajan, editor, Proc. of the 15th Conference on the Foundations of Software Technology and Theoretical Computer Science (FST & TCS) (Bangalore, 1995), Vol. 1026 of Lecture Notes in Computer Science, pages 210-224, Springer-Verlag.
Dendris, N. D., Kirousis, L. M., Stamatiou, Y. C, and Thilikos, D. M. Partial arc consistency. In Over-Constrained Systems (Cassis, 1995), Vol. 1106 of Lecture Notes in Computer Science, pages 229-236, Springer-Verlag.
Freuder, E. C. (1990). Complexity of k-tree structured constraint satisfaction problems. Proceedings of the Eighth National Conference on Artificial Intelligence, pages 4-9, Boston, Mass.
Gibbons, A. and Rytter, W. (1988). Efficient Parallel Algorithms. Cambridge University Press.
Goldschlager, L. M. (1977). The monotone and planar circuit value problems are log-space complete for P. SIGACT News 9(2): 25-29.
Van Hentenryck, P., Deville, Y., and Teng, C. M. (1992). A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57: 291-321.
Karp, R. M. and Ramachandran, V. (1990). Parallel algorithms for shared-memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Elsevier, Amsterdam.
Kasif, S. (1990). On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence 45: 275-286.
Kasif, S. and Delcher, A. L. Local consistency in parallel constraint satisfaction networks. Artificial Intelligence 69: 307-327.
Kirousis, L. M. Fast parallel constraint satisfaction. Artificial Intelligence 64: 147-160.
Lieberherr, K. J. and Specker, E. (1981). Complexity of partial satisfaction. J. of the ACM 28: 411-421.
Mackworth, A. K. (1992). Constraint satisfaction. In S. Shapiro, editor, Encyclopedia of Artificial Intelligence, 2nd ed., pages 285-293, Wiley, New York.
Mackworth, A. K. and Freuder, E. C. (1985). The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence 25: 65-74.
Mackworth, A. K. and Freuder, E. C. (1993). The complexity of constraint satisfaction revisited. Artificial Intelligence 59: 57-62.
Samal, A. and Henderson, T. C. (1987). Parallel consistent labeling algorithms. International Journal of Parallel Programming 16(5): 341-364.
Waltz, D. (1975). Understanding line drawings of scenes with shadows. Psychology of Computer Vision, pages 19-91, McGraw-Hill, New York.
Zhang, Y. and Mackworth, A. K. (1991). Parallel and distributed algorithms for finite constraint satisfaction problems. Proceedings 3rd IEEE Symposium on Parallel and Distributed Processing, pages 394-397, Dallas, TX.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dendris, N.D., Kirousis, L.M., Stamatiou, Y.C. et al. On Parallel Partial Solutions and Approximation Schemes for Local Consistency in Networks of Constraints. Constraints 5, 251–273 (2000). https://doi.org/10.1023/A:1009864716588
Issue Date:
DOI: https://doi.org/10.1023/A:1009864716588