Backtracking algorithms for constraint satisfaction problems

@inproceedings{Frost1998BacktrackingAF,
  title={Backtracking algorithms for constraint satisfaction problems},
  author={Daniel Frost},
  year={1998}
}
Over the past twenty ve years many backtracking algorithms have been developed for constraint satisfaction problems This survey describes the basic backtrack search within the search space framework and then presents a number of improvements developed in the past two decades including look back methods such as backjumping constraint recording backmarking and look ahead methods such as forward checking and dy namic variable ordering 
Highly Cited
This paper has 28 citations. REVIEW CITATIONS
20 Citations
61 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 61 references

34:1{38

  • R. Dechter, J. Pearl. Network-based heuristics for constraint sat Intelligence
  • Dec.
  • 1987
Highly Influential
4 Excerpts

Performance measurement and analysis of search algorithms

  • J. Gaschnig
  • Technical Report CMU-CS-79-124, Carnegie Mellon…
  • 1979
Highly Influential
10 Excerpts

Algorithms and Heuristics for Constraint Satisfaction Problems

  • D. H. Frost
  • PhD thesis, Information and Computer Science…
  • 1997

Arti cial Intelligence

  • G. Kondrak, P. van Beek. A theoretical evaluation of selected algorithms
  • 89:365{387,
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…