Constraint Satisfaction Problems are mathematical problems where a set of variables must satisfy a given set of constraints. CSPs are used in AI for tasks such as scheduling, resource allocation, and puzzle-solving. Techniques like Backtracking and Constraint Propagation are used to find feasible solutions.
Uncertainty in AI refers to the unpredictability or lack of full knowledge about a situation or outcome. AI models often encounter uncertainties due to…