[ IVLE ]
[ >Overview ]
[ Syllabus ]
[ Grading ]
[ Homework ]
[ Misc. ]
This module is finished as of Apr 2006. Please refer to the updated website for the current version of this course (when it is available).
Module Description (excerpted from the bulletin):
The module introduces the basic concepts in search and knowledge
representation as well as to a number of sub-areas of artificial
intelligence. It focuses on covering the essential concepts in AI. The
module covers Turing test, blind search, iterative deepening,
production systems, heuristic search, A* algorithm, minimax and
alpha-beta procedures, predicate and first-order logic, resolution
refutation, non-monotonic reasoning, assumption-based truth
maintenance systems, inheritance hierarchies, the frame problem,
certainly factors, Bayes' rule, frames and semantic nets, planning,
learning, natural language, vision, and expert systems and LISP.
- Modular credits: 4.
- Prerequisites: (CS 1102 Data Structures and Algorithms)
and (CS 1231 or CS 1231S Discrete Structures). Exceptions to these
pre-requisites can be made on a case-by-case basis only.
See instructor for details.
- Instructor: Min-Yen Kan, <firstname.lastname@example.org>.
Office: S15 05-05 (x1885). Office hours (after class) on Thursdays.
10:00 am - 12:00 n, or by appointment. Emails to me as a default are
assumed to be public, and my replies and your anonymized email will
likely be posted to IVLE. Please let me know if you do not
want the contents of your email posted; I will be happy to honor your
- Workload: (2-1-0-3-3) 2 lecture hours, 1 tutorial hour, 3
hours for assignments, and 3 hours preparation per week.
- Textbooks: Our textbook will be the same textbook as last
semester. You can buy it from your seniors for it or from the NUS
Co-op. Make sure you get the second edition textbook (it varies
greatly in material from the first edition). Copies are also on
reserve (RBR) at both the Science Library and the Central Library:
- Stuart Russell and Peter Norvig (2003) Artificial
Intelligence: A Modern Approach, Prentice Hall, 2nd
[ Check LINC for book ]
- Tutorial Sessions (SoC 1 / #04-34):
Tues (1) 14:00-15:00, (2) 15:00-16:00, (3) 16:00-17:00
- Final Exam: Monday,24 April 2006 (morning). The exam
is closed book with one allowed A4 sheet (double sided) with notes.
Note to NUS-external visitors: Welcome! If you're a fellow
A.I. course instructor looking for lecture material,
you can see the syllabus menu item on the left for a preview. Please
contact me if you'd like to use any of my material. Thanks!
This document, index.html, has been accessed 18589 times since 30-Dec-05 12:04:04 SGT.
This is the 1st time it has been accessed today.
A total of 5789 different hosts have accessed this document in the
last 4731 days; your host, ec2-18-212-93-234.compute-1.amazonaws.com, has accessed it 1 times.
Min-Yen Kan <email@example.com>
Mon Dec 6 10:01:55 GMT-8 2004
| Version: 1.0
| Last modified:
Tue Aug 28 14:59:44 2007