Science Fair Project Encyclopedia
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:
Examples of algorithms used in constraint-satisfaction problems:
See also:
External links
- One very good text on the subject is Edward Tsang's Foundations of Constraint Satisfaction.
Last updated: 05-10-2005 19:36:51
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details