CSCA 5012: Knowledge Representation and Reasoning Under Uncertainty

  • Course Type: MS-AI Breadth | MS-CS Elective
  • Specialization: Introduction to Artificial Intelligence/Algorithmic Foundations of AI
  • Instructor:ÌýDr. Rhonda Hoenigman, Teaching Professor
  • Prior knowledge needed:ÌýTBD

ÌýÌýView on CourseraÌý

Learning Outcomes

  • Analyze a complex computing problem and to apply principles of computing and other relevant disciplines to identify solutions.
  • Design, implement, and evaluate a computing-based solution to meet a given set of computing requirements in the context of the program’s discipline.
  • Communicate effectively in a variety of professional contexts.
  • Recognize professional responsibilities and make informed judgments in computing practice based on legal and ethical principles.
  • Function effectively as a member or leader of a team engaged in activities appropriate to the program’s discipline.
  • Apply computer science theory and software development fundamentals to produce computing-based solutions.

Course Grading Policy

AssignmentPercentage of Grade
Quiz 15%
Quiz 25%
Quiz 35%
Quiz 45%
Quiz 55%
Quiz 65%
Programming Assignment 120%
Programming Assignment 220%
Final Exam30%

Course Content

Duration: 4 hours

This module introduces how intelligent agents reason and make decisions in environments where information is incomplete, noisy, or uncertain. Students will learn the foundations of probability, including Bayes’ Rule and independence assumptions, and use these tools to perform probabilistic inference and update beliefs based on evidence. The module emphasizes both the sources of uncertainty and the methods AI systems use to act rationally despite it.

Duration: 3Ìýhours

This module focuses on using Bayesian Networks as tools for probabilistic reasoning and decision-making under uncertainty. Students will learn how to interpret a given network, compute probabilities, and perform inference—both exact and approximate—using techniques such as direct sampling and Gibbs sampling. Emphasis is placed on applying Bayes Nets to answer queries, update beliefs with evidence, and reason efficiently in complex domains.

Duration: 3Ìýhours

This module introduces temporal probabilistic models, focusing on how AI systems reason about hidden states that evolve over time. Students will learn to apply inference techniques such as filtering, prediction, smoothing, and the Viterbi algorithm to update beliefs and infer the most likely state sequences from observations. Emphasis is placed on using Hidden Markov Models to perform calculations and interpret how evidence shapes reasoning in dynamic, uncertain environments.

Duration: 2.5Ìýhours

This module introduces how AI agents make optimal decisions in uncertainty environments over time using the framework of Markov Decision Processes. Students will learn how to represent sequential decision problems with states, actions, rewards, and policies, and how to compute optimal behavior using value iteration, policy iteration, and the Bellman equation. Emphasis is placed on selecting actions that maximize expected utility in uncertain, sequential environments.

Duration: 1Ìýhour

Final Exam Format: In-course, non-proctored exam

This module contains materials for the final exam. You must unlock the exam to earn a grade for the course.

  • You may submit your exam only once.
  • The exam contains only multiple choice questions.
  • There are no programming questions in the exam.
  • You are not allowed to use any notes or access other websites when you take your exam.

Notes

  • Cross-listed Courses: CoursesÌýthat are offered under two or more programs. Considered equivalent when evaluating progress toward degree requirements. You may not earn credit for more than one version of a cross-listed course.
  • Page Updates: This page is periodically updated. Course information on the Coursera platform supersedes the information on this page. Click theÌýView on CourseraÌýbuttonÌýabove for the most up-to-date information.