Skip to main content

From evaluating upper bounds of the complexity of solving CSPs to finding all the solutions of CSPs

  • 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))

  • 137 Accesses

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

Access this chapter

Institutional subscriptions

References

  1. Dechter, R. and Pearl, J., “Network-Based Heuristics for Constraint-Satisfaction Problems”, Artificial Intelligence, No. 34, 1988, pp. 1–37.

    Google Scholar 

  2. Freuder E. C., “Synthesizing constraint expressions” Communications ACM, Vol. 21, No. 11, pp 958–966, Nov. 1978.

    Google Scholar 

  3. Freuder E. C, “Complexity of K-Trees Structured Constraint Satisfaction Problems”, Proceedings of National Conference on Artificial Intelligence (AAAI), pp. 4–9, 1990.

    Google Scholar 

  4. Seidel, R. “A new method for solving constraint satisfaction problems”, Proceedings 7th International Joint Conference on AI, pp. 338–342, 1981.

    Google Scholar 

  5. Tsang E.P.K., Foundations of Constraints Satisfaction, Academic Press, pp. 184–187.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Eugene C. Freuder

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Solotorevsky, G. (1996). From evaluating upper bounds of the complexity of solving CSPs to finding all the solutions of CSPs. 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_115

Download citation

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

  • 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