Loading timeline…
19701970s
Constraint Satisfaction Problems
Mathematical questions defined as a set of objects whose state must satisfy constraints.
Why It Was Important
Formalized heavily in the 1970s, CSPs involve finding states or values that respect strict rules (e.g., Sudoku, scheduling, route planning). AI developed generalized algorithms (like constraint propagation and backtracking) to solve these NP-hard combinatorial puzzles efficiently.
Who Invented It
Various mathematicians & AI researchers
Early computer scientists working on combinatorial optimization.
Applications
- Operations Scheduling
- Resource Allocation
- Route Planning
Key Papers
- Consistency in Networks of Relations
Alan K. Mackworth · Artificial Intelligence · 1977
Videos
Constraint satisfaction problems
Francisco Iacobelli