Skip to main content
SpringerLink
Log in

Constraint satisfaction via partially parallel propagation steps

  • Conference paper
  • First Online:
Parallelization in Inference Systems

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 590))

Abstract

The constraint satisfaction problem (CSP) deals with the assignment of values to variables according to existing constraints. Given n variables with their finite domains, the admissible combinations of values form a set of n-tuples which represents the globally consistent solution. This article presents a parallel approach to global constraint satisfaction.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hölldobler, Steffen; Hower, Walter: Constraint Satisfaction in a Connectionist Inference System. Fb-I 2/91, April 1991; IV International Symposium on Artificial Intelligence, CancÚn, Proceedings (eds.: Francisco J. CantÚ-Ortiz, Hugo Terashima-Marín), Editorial Limusa, S.A. de C.V., México, pp. 215–221, November 13–15, 1991

    Google Scholar 

  2. Hower, Walter: A Lattice-based Constraint Formalism. First Australian Knowledge Engineering Congress, Workshop on AI & Creativity, Melbourne, draft collection, Deakin University, Geelong, Victoria, Australia, March 14/15, 1989

    Google Scholar 

  3. Hower, Walter: A novel algorithm for global constraint satisfaction. Fb-I Bericht 14/90, February 1991

    Google Scholar 

  4. Hower, Walter: Parallel global constraint satisfaction. PPAI-91, Informal Proceedings of the IJCAI-91 Workshop on Parallel Processing for Artificial Intelligence, Darling Harbour, Sydney, New South Wales, Australia, pp. 80–85, August 24/25, 1991

    Google Scholar 

  5. Kasif, Simon: On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks. AI-j 45 (3), pp. 275–286, 1990

    Google Scholar 

  6. Mackworth, Alan K.; Freuder, Eugene C.: The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems. AI-j 25 (1), pp. 65–73/74, 1985

    Google Scholar 

  7. Nishihara, Seiichi; Matsuo, Yoshikazu: On Parallelization of Merge Method for Consistent Labeling Problems. Probably in a Journal of the Japanese Society for Artificial Intelligence 6 (1), pp. 124–128, January 1991

    Google Scholar 

  8. Samal, Ashok; Henderson, Tom: Parallel Consistent Labeling Algo-rithms. Ij-P 16 (5), pp. 341–364, 1987

    Google Scholar 

  9. Swain, Michael J.: Comments on Samal and Henderson: “Parallel Consistent Labeling Algorithmsℍ. Ij-P 17 (6), pp. 523–528, 1988

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik Fachbereich 4, Universität Koblenz-Landau, Rheinau 3-4, D-W-5400, Koblenz, Federal Republic of Germany

    Walter Hower

Authors
  1. Walter Hower
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Fronhöfer G. Wrightson

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hower, W. (1992). Constraint satisfaction via partially parallel propagation steps. In: Fronhöfer, B., Wrightson, G. (eds) Parallelization in Inference Systems. Lecture Notes in Computer Science, vol 590. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55425-4_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-55425-4_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55425-7

  • Online ISBN: 978-3-540-47066-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation