Course Instructor: Prof. Deepak Khemani, Department of Computer Science and Engineering, IIT Madras. He has completed his B. Tech in Mechanical Engineering, followed by an M.Tech and Ph.D. in Computer Science from IIT Bombay.
The course will discuss the following topics:
Introduction: History, Can machines think? Turing Test, Winograd Schema Challenge, Language and Thought, Wheels and Gears.
Introduction: Philosophy, Mind, Reasoning, Computation, Dartmouth Conference, The Chess Saga, Epiphenomena.
State Space Search: Depth First Search, Breadth-First Search, Depth First Iterative Deepening.
Heuristic Search: Best First Search, Hill Climbing, Solution Space, TSP, Escaping Local Optima, Stochastic Local Search.
Population-Based Methods: Genetic Algorithms, SAT, TSP, emergent Systems, Ant Colony Optimization.
Finding Optimal Paths: Branch and Bound, A, Admissibility of A, Informed Heuristic Functions.
Space Saving Versions of A: Weighted A, IDA, RBFS, Monotone Condition, Sequence Alignment, DCFS, SMGS, Beam Stack Search.
Game Playing: Game Theory, Board Games and Game Trees, Algorithm Minimax, AlphaBeta, and SSS.
Automated Planning: Domain-Independent Planning, Blocks World, Forward and Backward Search, Goal Stack Planning, Plan Space Planning.
Problem Decomposition: Means Ends Analysis, Algorithm Graphplan, Algorithm AO.
Rule-Based Expert Systems: Production Systems, Inference Engine, Match-Resolve-Execute, Rete Net.
Deduction as Search: Logic, Soundness, Completeness, First Order Logic, Forward Chaining, Backward Chaining.
Constraint Processing: CSPs, Consistency Based Diagnosis, Algorithm Backtracking, Arc Consistency, Algorithm Forward Checking.
Who can apply?
Computer science and engineering students as well as anyone comfortable with the language of algorithms.
When to apply?
The date of joining will be updated soon
Certificate: Participants will have to successfully complete courses on NPTEL and clear examinations to receive a certificate.