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.
Instance-Based Learning is an AI approach where models make predictions based on similarity to previously seen examples. Instead of generalising from a predefined set…