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.
Recommender Systems are AI systems that provide personalised recommendations to users based on their preferences and previous behaviour. These systems analyse large amounts of…