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.
Bayesian networks are Probabilistic Graphical Models that represent and evaluate uncertainty and conditional dependencies between variables. Industries such as healthcare and finance use Bayesian…