Skip to main content
SpringerLink
Log in
Book cover

Catalogue of Artificial Intelligence Tools pp 20–21Cite as

Constraint Satisfaction And Propagation

Alias: consistent-labeling, satisfaction assignment

  • Chapter

  • 16 Accesses

Part of the book series: Symbolic Computation ((1064))

Abstract

Many problems in Artificial Intelligence, Operations Research and Symbolic Logic can be seen as special cases of this general NP-complete problem; for example, some problems that are naturally viewed in this way are scene labeling and scene matching or more generally, the relational homomorphism problem, finding spanning trees and Euler tours in a graph, space planning problems, data-base consistency-maintenance, query-answering and redundancy-checking and many puzzles such as cryptarithmetic. Other examples are: the Boolean Satisfiability problems. Graph and Sub-graph Isomorphism detection, the graph coloring problem, packing problems, finding Hamiltonian circuits in a graph and edge detection <65> in a scene.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Nudel. B.A. Consistent-labeling problems and their algorithms: expected-complexities and theory-based heuristics. Artificial Intelligence 20. 1983. Special issue on Search and Heuristics, in memory of John Gaschnig; to appear.

    Google Scholar 

  2. Stefik, M.J. Planning with constraints (Molgen: part 1). Artificial Intelligence 14, 1980

    Google Scholar 

  3. Waltz, D. L. Understanding line drawings of scenes with shadows. In Winston, P.H. (editor). The Psychology of Computer Vision. McGraw-Hill, New York, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Artificial Intelligence, Edinburgh University, Hope Park Square, Meadow Lane, Edinburgh, EH8 9NW, Scotland

    Alan Bundy

Authors
  1. Alan Bundy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lincoln Wallen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Artificial Intelligence, Edinburgh University, Hope Park Square, Meadow Lane, Edinburgh, EH8 9NW, Scotland

    Alan Bundy

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bundy, A., Wallen, L. (1984). Constraint Satisfaction And Propagation. In: Bundy, A., Wallen, L. (eds) Catalogue of Artificial Intelligence Tools. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96868-6_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-96868-6_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13938-6

  • Online ISBN: 978-3-642-96868-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation