Algorithms for Constraint Satisfaction Problems: A Survey (1992)
| Venue: | AI MAGAZINE |
| Citations: | 328 - 0 self |
BibTeX
@ARTICLE{Kumar92algorithmsfor,
author = {Vipin Kumar},
title = {Algorithms for Constraint Satisfaction Problems: A Survey},
journal = {AI MAGAZINE},
year = {1992},
volume = {13},
number = {1},
pages = {32--44}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A large variety of problems in Artificial Intelligence and other areas of computer science can be viewed as a special case of the constraint satisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, planning 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 backtracking to directly search for possible solutions. Some are a combination of these two techniques. This paper presents a brief overview of many of these approaches in a tutorial fashion.
