Algorithms for Constraint-Satisfaction Problems: A Survey

@article{Kumar1992AlgorithmsFC,
  title={Algorithms for Constraint-Satisfaction Problems: A Survey},
  author={Vipin Kumar},
  journal={AI Magazine},
  year={1992},
  volume={13},
  pages={32-44}
}
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments, and the satisfiability problem. A number of different approaches have been developed for solving these problems. Some of them use constraint propagation to simplify the original problem. Others use… CONTINUE READING
Highly Influential
This paper has highly influenced 76 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
592 Extracted Citations
95 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 592 extracted citations

Referenced Papers

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

Some Applications of the ConstraintSatisfaction Problem

  • B. Nadel
  • Technical Report, CSC-90008,
  • 1990
Highly Influential
2 Excerpts

Backtrack-Free and BacktrackBounded Search

  • E. Freuder
  • Search in Artificial Intelligence, eds. L. Kanal…
  • 1988
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…