Abstract
A Constraint Satisfaction Problem (CSP) involves searching for an assignment of values to a given set of variables so that the values assigned satisfy a given set of constraints. The general CSP is NP-complete. To confront the intractability of the general CSP, relaxation procedures have been devised: instead of searching for a globally consistent assignment of values to the variables, try to restrict the domain of values of each variable in a way that ensures local consistency only. The relaxation procedures are efficient, but have been proved to be inherently sequential. In this paper, we define a class of CSPs for which a global solution can be found by a fast parallel algorithm. No relaxation preprocessing is needed for the parallel algorithm to work. The result is motivated from the problem of labelling a 2-D line drawing of a 3-D object by the Clowes-Huffman-Malik labelling scheme—an important application of CSP in computer vision. For such a labelling CSP, the constraint graph can be general, but the constraint relations are usually of the type we call implicational. It is shown here that a CSP with this type of constraint relations (and no restrictions on its graph) can be solved by an efficient (i.e., with polynomial time complexity) sequential algorithm. Also, it is shown that it can be solved by a fast parallel algorithm that executes in time O(log3 n) with O((m+n 3)/log n) processors on a Exlusive-Read-Exclusive-Write Parallel Random Access Machine (n is the number of variables and m is the number of constrain relations—the constraint relations may have arity more than two).
This research was partially supported by the European Community ESPRIT Basic Research Program under contracts 7141 (project ALCOM II) and 6019 (project Insight II).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
P. Alevizos, “A linear algorithm for labeling planar projections of polyhedra,” Proc. IEEE/RSJ Int. Workshop on Intelligent Robots and Systems (Osaka, Japan, 1991), 595–601.
R. Anderson and E. Mayr, “Parallelism and greedy algorithms”, Advances in Computing Research 4 (1987), 17–38.
M.B. Clowes, “On seeing things,” Artifical Intelligence, 2 (1971), 79–116.
S.A. Cook and M. Luby, “A simple parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula”, Information Processing Letters, 27 (1988), 141–145.
S.A. Cook, “A taxonomy of problems with fast parallel algorithms,” Information and Control, 64 (1985), 2–22.
D. Coppersmith and S. Winograd, “Matrix multiplication via arithmetic progressions,” Proc. 28th Ann. ACM Symp. on Theory of Computing (1987), 1–6.
R. Dechter, “From local to global consistency,” Artificial Intelligence 55 (1992), 87–107.
N. Dendris, I. Kalafatis and L.M. Kirousis, “Labelling images of the pottery world,” Proc. 3rd Intl. Symp. on Algorithms and Computation, ISAAC '92 (Springer-Verlag).
P.R. Cooper and M.J. Swain, “Arc consistency: parallelism and domain dependence,” Artificial Intelligence 58 (1992), 207–235.
E.C. Freuder, “A sufficient condition for backtrack-free search,” JACM, 29 (1982), 24–32.
E.C. Freuder, “A sufficient condition for backtrack-bounded search,” JACM, 32 (1985), 755–761.
M. Goldberg and T. Spencer, “Constructing a maximal independent set in parallel,” SIAM J. Discrete Mathematics, 2 (1989), 322–328.
P.V. Hentenryck, Y. Deville, and C.-M. Teng, “A generic arc-consistency algorithm and its specializations,” Artificial Intelligence 57 (1992), 291–321.
D.A. Huffman, “Impossible objects as nonsense sentences,” Machine Intelligence, 6 (1971), 295–323.
R.M. Karo and V. Ramachandran, “Parallel algorithms for shared-memory machines,” in: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, vol. A (Elsevier, 1990), 869–942.
R.M. Karp and A. Wigderson, “A fast parallel algorithm for the maximal independent set problem,” J. Association of Computing Machinery, 32 (1985), 762–773.
S. Kasif, “On the parallel complexity of discrete relaxation in constraint satisfaction networks,” Artificial Intelligence, 45 (1990), 275–286.
L.M. Kirousis and C.H. Papadimitriou, “The complexity of recognizing polyhedral scenes,” Journal of Computer and System Sciences, 37 (1988), 14–38.
M. Luby, “A simple parallel algorithm for the maximal independent set problem,” SIAM J. Computing 15 (1986), 1036–1053.
A.K. Mackworth and E.C. Freuder, “The complexity of some polynomial network consistency algorithms for constraint satisfaction problems,” Artificial Intelligence 25 (1985), 65–74.
J. Malik, “Interpreting line drawings of curved objects,” International J. of Computer Vision, 1 (1987), 73–103.
R. Mohr and T.C. Henderson, “Arc and path consistency revisited,” Artificial Intelligence 28 (1986), 225–233.
U. Montanari and F. Rossi, “Constraint relaxation may be perfect,” Artificial Intelligence, 48 (1991), 143–170.
P. Parodi and V. Torre, “On the complexity of labelling line drawings of polyhedral scenes”, ICCV 1993, to appear.
M. Perlin, “Arc consistency for factorable relations,” Artificial Intelligence 53 (1992), 329–342.
A. Samal and T. Henderson, “Parallel consistent labeling algorithms,” Int. J. Parallel Programming, 16 (1987), 341–384.
M.J. Swain, “Comments on Samal and Henderson: ‘Parallel consistent labeling algorithms',” Int. J. Parallel Programming, 17 (1988), 523–528.
J.D. Ullman, Principles of Database Systems, 2nd ed. Computer Science Press, 1982.
P. van Beek, “On the minimality and. decomposability of constraint networks,” Proc. AAAI, 1992
P. Van Hentenryck, Y. Deville, and C.-M. Teng, “A generic arc-consisstency algorithm and its specializations,” Artificial Intelligence 57 (1992), 291–321.
D. Waltz, “Understanding line drawings of scenes with shadows,” in: P.H. Winston (ed.), The Psychology of Computer Vision, (McGraw-Hill, New York, 1975), 19–91.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kirousis, L.M. (1993). Fast parallel constraint satisfaction. In: Lingas, A., Karlsson, R., Carlsson, S. (eds) Automata, Languages and Programming. ICALP 1993. Lecture Notes in Computer Science, vol 700. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_91
Download citation
DOI: https://doi.org/10.1007/3-540-56939-1_91
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56939-8
Online ISBN: 978-3-540-47826-3
eBook Packages: Springer Book Archive