Introduction to three key foundational problems in AI: planning, search, and reasoning under uncertainty. Investigate how to define planning domains, including representations for world states and actions, covering both symbolic and path planning. Study algorithms to efficiently find valid plans with or without optimality, and partially ordered, or fully specified solutions. Three lecture hours a week for one semester Only one of the following may be counted: Artificial Intelligence 388U, Computer Science 388U, 395T (Topic: Planning Search and Reasoning). Prerequisite: Graduate standing; and knowledge of undergraduate data structures, algorithms, and complexity; and prior knowledge in probability theory or statistics.