Encyclopedia > Constraint-satisfaction problem

  Article Content

Constraint satisfaction problem

Redirected from Constraint-satisfaction problem

Constraint-satisfaction problems or CSPs are mathematical problems where one must find states or objects in a system that satisfy a number of constraints or criteria. CSPs are the subject of intense research in both artificial intelligence and operations research. Many CSPs require a combination of heuristics and combinatorial search methods to solve in a reasonable time.

Examples of constraint-satisfaction problems:

See also:

External links



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Quioque, New York

... 31.0% from 25 to 44, 21.9% from 45 to 64, and 16.9% who are 65 years of age or older. The median age is 39 years. For every 100 females there are 113.3 males. For every ...

 
 
 
This page was created in 24.1 ms