Skip to main content

Intelligent Systems I:  2009-2010

Lecturer

Degrees

Schedule B2Computer Science

Schedule B2Mathematics and Computer Science

ECS Part IIMEng Engineering and Computing Science

Schedule BMSc in Computer Science

MSc by Research

Term

Overview

To teach students the principal issues that arise in the theory, implementation and application of intelligent software systems. Here "intelligent systems" will be taken to mean those that have the ability to represent and reason about complex tasks given limited computational resources.

Synopsis

  1. Fundamental Issues. Possibility of achieving intelligent behaviour; objections to intelligent systems; the Turing test; rational actions. [2]
  2. Search. Problem solving as search; search strategies; informed search methods. [3]
  3. Planning and scheduling. [3]
  4. Introduction to probabilistic reasoning. Probability theory; Bayes' theorem; Bayesian Networks; Markov processes. [4]
  5. Practical systems. Dealing with extent. Case studies. [3]

Syllabus

Fundamental issues in intelligent systems. Searching and planning. Introduction to probabilistic reasoning: Bayes rule, forward inference, and the Kalman filter. Dealing with uncertainty and geometry for physical agents.

Reading list

  • Bratko, Prolog Programming for Artificial Intelligence (3rd ed), Addison-Wesley, 2000.
  • S.J. Russell and P. Norvig, Artificial Intelligence: A Modern Approach (2nd ed), Prentice-Hall, 2001.