Found 2 records with CourseId:7857 in academic section database. Picking the first.

Course Name: CS6680 : Planning and Constraint Satisfaction

Description: 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.

Slot: A

RoomNo: CS36

Instructor: Deepak Khemani

Period: JAN-MAY 2013

This page was created on: Thursday 19th of September 2013 09:41:01 PM