Syllabus for End Semester Exam: 32002: Artificial Intelligence

April 15, 2014
  1. Knowledge Representation: Ontological engineering, categories, objects, actions, situations, Situation Calculus, semantic networks, description logics
  2. Solving Problems by Searching: Un-informed search strategies: Breadth first search, Depth-first search, Depth-limited search, Iterative deepening depth-first search, bidirectional search; Informed search and exploration: Greedy best-first search, A* search.
  3. Local search algorithms and Optimization: Hill climbing, Simulated Annealing, Local beam search, Genetic Algorithms.
  4. Constraint Satisfaction Problems: Backtracking search for CSPs, Local search for CSPs;
  5. Adversarial Search: Optimal Decision in Games, The minimax algorithm, Alpha-Beta pruning;
  6. Planning: Planning with state space search, Partial-Order Planning, Planning Graphs, Planning with Propositional Logic, hierarchical task network planning, multi-agent planning;
  7. Miscellaneous Topics: Fuzzy logic systems, Natural Language Processing.