Skip to main content

N-ary consistencies and constraint-based backtracking

  • Posters
  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming — CP96 (CP 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1118))

  • 141 Accesses

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

Access this chapter

Institutional subscriptions

References

  1. R. Dechter and P. van Beek. Local and global relational consistency. In Proceedings of the 1 st International Conference on Principles and Practice of Constraint Programming, pages 240–257, Cassis, 1995.

    Google Scholar 

  2. Ph. Jégou. Contribution à l'étude des problèmes de satisfaction de contraintes: algorithmes de propagation et de résolution — propagation de contraintes dans les réseaux dynamiques. PhD thesis, Université des Sciences et Techniques du Languedoc, Montpellier, 1991.

    Google Scholar 

  3. U. Montanari. Networks of constraints: Fundamental properties and applications to pictures processing. Information Sciences, 7:95–132, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Eugene C. Freuder

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mérel, PP., Habbas, Z., Herrmann, F., Singer, D. (1996). N-ary consistencies and constraint-based backtracking. In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_111

Download citation

  • DOI: https://doi.org/10.1007/3-540-61551-2_111

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61551-4

  • Online ISBN: 978-3-540-70620-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics