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

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


  1. 1.
    Dechter, R. and Pearl, J., “Network-Based Heuristics for Constraint-Satisfaction Problems”, Artificial Intelligence, No. 34, 1988, pp. 1–37.Google Scholar
  2. 2.
    Freuder E. C., “Synthesizing constraint expressions” Communications ACM, Vol. 21, No. 11, pp 958–966, Nov. 1978.Google Scholar
  3. 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. 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. 5.
    Tsang E.P.K., Foundations of Constraints Satisfaction, Academic Press, pp. 184–187.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Gadi Solotorevsky
    • 1
  1. 1.Dept. of Mathematics and Computer ScienceBen-Gurion University of the NegevBeer-ShevaIsrael

Personalised recommendations