Al3391 - Ai Theory Syllabus
Al3391 - Ai Theory Syllabus
3 0 0 3
COURSE OBJECTIVES:
Heuristic search strategies – heuristic functions. Local search and optimization problems –
local search in continuous space – search with non-deterministic actions – search in partially
observable environments – online search agents and unknown environments
Game theory – optimal decisions in games – alpha-beta search – monte-carlo tree search –
stochastic games – partially observable games. Constraint satisfaction problems – constraint
propagation – backtracking search for CSP – local search for CSP – structure of CSP.
Acting under uncertainty – Bayesian inference – naïve Bayes models. Probabilistic reasoning
– Bayesian networks – exact inference in BN – approximate inference in BN – causal
networks.
COURSE OUTCOMES:
TOTAL: 45 PERIODS
TEXT BOOKS:
REFERENCES