Material for "Introduction to Artificial Intelligence" Classes

Slides (and Handouts)

• Lecture 01: Intelligent Agents
• Lecture 02: Propositional Logic
• Lecture 03: First Order Logic (Handout)
• Lecture 04: Rule-Based (Expert) Systems
• Lecture 05: Ontologies and Semantic Networks
• Lecture 06: Decision Tree Learning
• Lecture 07: Perceptron Learning (Handout, C Code for Gradient Descent Learning)
• Lecture 08: (Artificial) Neural Network Learning (Handout)
• Lecture 09: Function Optimization with Local Search
• Lecture 10: Probabilities
• Lecture 11: Bayesian Networks (= Belief Networks)
• Lecture 12: Naive Bayesian Learning
• Lecture 13: Planning Agents
• Lecture 14: STRIPS (Handout)
• Lecture 15: SAT-Based Planning
• Lecture 16: Uninfomed Search
• Lecture 17: Constraint Satisfaction
• Lecture 18: Heuristic Search
• Lecture 19: Search-Based Planning
• Lecture 20: Decision Theory
• Lecture 21: Markov Decision Processes (C Code for Value Iteration without Discounting and with Discounting)
• Lecture 22: Adversarial Search

Assignments (and Sample Solutions)

Note: A few of the assignment questions come from previous exams, homeworks and similar sources from other universities, including from Vincent Conitzer (Duke), Andrew Moore (CMU), Peter Norvig (Google) and Stuart Russell (UC Berkeley). In a few cases, the originators are no longer known but we appreciate any leads to be able to list them here.

• about 100 CS360 assignments
• sample solutions for the CS360 assignments

Projects

• Computer Games in the Classroom

Home Page of Sven Koenig