Artificial Intelligence, LP4, VT 2014

This is an old website! For the current version, visit: http://www.cse.chalmers.se/edu/course/TIN172/

The lectures are 10.00–11.45 on Tuesdays and Fridays until week 20. Tuesday lectures will be in HC4 (except the first two Tuesdays which will be in HC3). Friday lectures will be in HA4.

Note: All chapter and section references are for the course book, as are all slides, unless otherwise specified. (I use n:m to refer to specific slides, where n is the chapter and m is the “lecture”).

Note: Christos has put lecture notes and exercises on Piazza.

Tue 18 Mar (HC3)

Course introduction [slides 1:1, 1:2, and 1:3 as a bonus]

Overview of the first two chapters:

• Chapter 1: Artificial Intelligence and Agents
• Chapter 2: Agent Architectures and Hierarchical Control

Mathematical preliminaries (self-reading):

• Appendix: Mathematical Preliminaries and Notation

About the project and forming project groups

Fri 21 Mar (HA4)

Chapter 3: States and Searching

• [3.1] Problem Solving as Search
• [3.2] State Spaces
• [3.3] Graph Searching
• [3.4] A Generic Searching Algorithm
  • [slides 3:1]
• [3.5] Uninformed Search Strategies
  • [slides 3:2]
• [3.6] Heuristic Search
  • [slides 3:3]
• [3.7–3.7.3] More Sophisticated Search (not 3.7.4–3.7.6)
  • [slides 3:4, 3:5]
  • Skip the last four pages of 3:4, there is an updated PDF
  • Skip branch-and-bound for 3:5, there is an updated PDF

Tue 25 Mar (HC3)

Chapter 4: Features and Constraints

• [4.1] Features and States
• [4.2] Possible Worlds, Variables, and Constraints
• [4.3] Generate-and-Test Algorithms
• [4.4] Solving CSPs Using Search
• [4.5] Consistency Algorithms
• [4.6] Domain Splitting
  • [slides 4:1, modified PDF]
• [4.8] Local Search
  • [slides 4:2, modified PDF]

Fri 28 Mar (HA4)

Chapter 8: Planning with Certainty

• [8.1] Representing States, Actions, and Goals
  • [slides 8:1]
• [8.2] Forward Planning
  • [slides 8:2]
• [8.3] Regression Planning
  • [slides 8:3]
• [8.4] Planning as a CSP
  • [slides 8:4]
• [8.5] Partial-Order Planning
  • Note: There is a small error on line 29 in figure 8.5 — but I leave it for you to find out what the problem is!

Tue 1 Apr (HC4)

Chapter 5: Propositions and Inference

• [5.1] Propositions
  • [slides 5:1]
• [5.2] Propositional Definite Clauses
  • [slides 5:2, 5:3]
• [5.3–5.3.3] Knowledge Representation Issues
  • This section is not necessary for the exam, but can be interesting for the project

Chapter 12: Individuals and Relations

• This chapter is not necessary for the exam, but can be interesting for the project.
• [12.1] Exploiting Structure Beyond Features
• [12.2] Symbols and Semantics
• [12.3] Datalog: A Relational Rule Language (very briefly)
• [12.5] Function Symbols (even more briefly)
  • [a potpourri of slides from 12:1–12:4]
• [12.6] Applications in Natural Language Processing
  • [slides 12:5]

Fri 4 Apr (HA4)

Chapter 6: Reasoning under Uncertainty

• [6.1–6.1.4] Probability (not 6.1.5)
• [6.2] Independence
• [6.3] Belief Networks (but not 6.3.1)
  • [Christos’ lecture slides]

Christos’ lecture notes about introduction to probability and subjective probability.

Tue 8 Apr (HC4)

Chapter 9: Planning under Uncertainty

• [9.1] Preferences and Utility
  • [Christos’ lecture slides about utility]
• [9.2] One-Off Decisions
  • [Christos’ lecture slides about decision problems]

Christos’ lecture notes about decision problems.

 

(No lectures during weeks 16–18)

Tue 6 May (HC4)

More probability:

• [6.1–6.3] Probability, Independence, and Belief Networks
• [6.4.1] Probabilistic infereence, variable elimination

…and chapter 9 again:

• [9.1–9.2] Preferences, Utility, and Decisions

Fri 9 May (HA4)

Even more chapter 9:

• [9.3] Sequential Decisions
• [9.5–9.5.4] Decision processes

Tue 13 May (HC4)

Example examination questions

Fri 16 May (HA4)

Chapter 10: Multiagent Systems

• [10.1] Multiagent Framework
• [10.2] Representations of Games
• [10.3] Computing Strategies with Perfect Information