Department of Computer Science & Engineering

Constraint Satisfaction Problems : Introdcution, Algorithms, Complexity, modeling problems using CSP, Satisfiability ? Introduction, complexity, algorithms ? local search and global search. Satisfiability encoding iemma. Planning ? introduction, complexity, PDDL (syntax). Domain Independent planning, domain description, PDDL (syntax), reduction to satisfiability, reduction to graph search. Heuristic search planners, forward vs. backward search, planning graph. Durative and temporal actions. Planning under uncertainity. GraphPlan, SatPlan, HSP, SAPA.