Constraint satisfaction problems are mathematical questions defined by a set of objects and constraints that must be satisfied. They are studied in artificial intelligence and operations research, and can be solved using constraint programming, Boolean satisfiability problem, satisfiability modulo theories, mixed integer programming, and answer set programming. Examples of CSPs include automated planning, lexical disambiguation, musicology, product configuration, and resource allocation.
UC Berkeley
Fall 2022
UC Berkeley's CS 188 course covers the basic ideas and techniques for designing intelligent computer systems, emphasizing statistical and decision-theoretic modeling. By the course's end, students will have built autonomous agents that can make efficient decisions in a variety of settings.
No concepts data
+ 20 more concepts