CS5201/CS5205: Advanced Artificial Intelligence & Lab (Spring 2025) |
|||||||||
| This course will provide a basic understanding of classical artificial intelligence that includes different search methods, constraint satisfaction problems, logic, planning methods, etc. We may explore some data driven methods if time permits. |
Lecture schedule |
|||||||||
| Monday — 1400-1500; Tuesday — 1400-1500; Thursday — 1400-1500; | |||||||||
| Venue — LT001; | |||||||||
Lab schedule |
|||||||||
| Friday — 0900-1200; | |||||||||
| Venue — CSE Lab, Block-2; |
Instructor & TAs |
|||||||||
| Instructor |
TAs
|
||||||||
Syllabus |
|||||||||
|
Introduction and motivation Artificial Intelligence, intelligent agents, nature of environments Problem-solving by searching: Example problems, uninformed, informed search strategies Uninformed/ blind search techniques: Breadth-first search (BFS), Depth-first search (DFS), Uniform-cost search (UCS) Informed search: Heuristic function design and evaluation, A* search Beyond classical search: local search techniques and optimization, hill climbing, simulated annealing, beam search Adversarial search: Games, optimal decision in games, min-max, alpha-beta pruning, partially observable games Problem reduction techniques: And-OR (AO) and AO* Constraint Satisfaction Problem (CSP): definition and examples of CSPs, basic techniques: backtracking search, forward checking, arc consistency Knowledge Representation, Reasoning, and Planning: Propositional logic, first-order logic, inference, planning Learning Techniques: meta-heuristic (genetic algorithm), Bayesian, decision tree, etc. Some advanced techniques of AI and its applications |
Books |
|||||||||
|
Lecture Slides |
|||||||||
| Topic | Slides | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Introduction | |||||||||
| Automated problem solving | |||||||||
| State space search | |||||||||
| Heuristic search | |||||||||
| Game tree search | |||||||||
| CSP | |||||||||
| Propositional logic | |||||||||
| Predicate logic | |||||||||
| SAT | |||||||||
| Prolog programming | |||||||||
| Local search | |||||||||
| Introduction to Planning | |||||||||
| Probabilistic reasoning | |||||||||
| Decision trees | |||||||||
Lab schedule |
|||||||||
| Topic | Slides | Assignment | Deadline | ||||||
|---|---|---|---|---|---|---|---|---|---|
| Warmup | NA | NA | NA | ||||||
| State space-1 | NA |
pdf, Sample input, Submission procedure, Submit here |
19.01.2025 | ||||||
| State space-2 | NA |
pdf, All testcases, Upload 'assg02.cpp' or 'assg02.py' |
29.01.2025 | ||||||
| State space-3 | NA |
pdf Upload 'assg03.cpp' or 'assg03.py' |
07.02.2025 | ||||||
| CSP | NA |
pdf, Upload 'assg04.cpp' or 'assg04.py' Upload 'genTestcase.cpp' or 'genTestcase.py' |
28.02.2025 | ||||||
| Midsem | NA |
|
21.02.2025 | ||||||
| SAT | NA |
pdf, Upload 'assg05.cpp' or 'assg05.py' Upload 'report.pdf' |
07.03.2025 | ||||||
| Prolog | NA |
pdf |
NA | ||||||
Projects |
|||||||||