CSE 3402 Introduction to Concepts of Artificial Intelligence
Department of Computer Science and Engineering,
This course is an introductory exposition to topics in Artificial
Intelligence (AI). It covers, in some depth, some core subjects of
current research and deployed applications in AI: search, knowledge
representation, reasoning, intelligent agents and their modeling,
acting and planning, neural networks, and genetic algorithms. Other
important subareas of AI, such as robotics or computer vision, are
discussed in depth in other courses.
- Apr. 1: The final exam is on Wed. April 7 from 2pm to 4pm in
Vari Hall 1018. It covers all material seen during the whole term,
but the emphasis will be on material seen since Week 6 inclusively.
March 15: Assignment 3 is out; it is due
on April 5..
Use this Golog interpreter.
See also this elevator controller
example Golog program.
Note that you should change the extensions from .swipl to .pl
before you load the files into SWI Prolog.
Feb. 28: On March 1, there will be no class; the missed class will be made up
by an extended class on March 12, 2pm-4pm in CSE 2002.
Feb. 16: Assignment 2 is out; it is due
on March 10 (extended!).
- On Feb. 22 and 24 there will be no class.
There will be an extended class on Feb. 26, 2pm-4pm in CSE 2002
(thaught by Prof. Stachniak).
Classes on March 1 and 3 will be held at the normal time and location.
There will be an extended class on March 5, 2pm-4pm in CSE 2002.
There will be no office hours from Feb. 17 to Feb. 27;
if you have questions please contact the instructor by email.
Feb. 15-19 is reading week and there are no classes; the only office hour will be on Feb. 16 at 11am.
February 5: The midterm test will be held during class on Friday
February 12. It will cover all material seen since the beginning of term
up to and including Week 5 Constraint Satisfaction Problems and Backtracking Search.
January 27: Assignment 1 is out; it is due
on February 8.
January 25: On January 29, we will have an extended class from 2pm to 4pm
in CSE 2002; this is to make up for the cancelled class on January 18.
- The class on January 18 is cancelled; it will be rescheduled. The office hour on January 18 is also cancelled.
- Classes start January 4.
Prof. Yves Lespérance
Office: CSEB 3052A
Tel: 736-2100 ext. 70146
Email: lesperan "at" cse.yorku.ca
Monday, Wednesday, and Friday from 14:30 to 15:30 in TEL 1005.
Instructor Office Hours
Monday and Wednesday 16:00-17:00, and Friday 13:30-14:20.
Russell, S.J. and Norvig, P.,
Artificial Intelligence: A Modern Approach, 3rd edition
Prentice Hall, 2010.
Authors' web site,
Publisher's web site.
The textbook is required; it is available at the York University
AK/AS/SC/COSC 3401 3.0 or AK/AS/SC/CSE 3401 3.0; AK/AS/SC/MATH 1090 3.0.
Knowledge of Prolog and first-order logic.
| Assignements (3 @ 10% each) || 30%|
| Midterm test || 25%|
| Final exam || 45%|
| Total|| 100%|
- Week 1 (Jan 4) Introduction & intelligent agents (R&N ch. 1 & 2).
- Week 2 (Jan 11) Uninformed search (R&N ch. 3, sec. 1 to 4).
- Week 3 (Jan 18) Informed search (R&N ch. 3, sec, 5 to 7).
- Week 4 (Jan 25) Game/Adversarial Search (R&N ch. 5).
- Week 5 (Feb 1) Constraint satisfaction and backtracking search (R&N ch. 6).
- Week 6 (Feb 8) Logical representations (R&N ch. 7 & 8).
- Reading Week (Feb 15) No lectures.
- Week 7 (Feb 22) Inference in first-order logic (R&N ch. 9).
- Week 8 (Mar 1) Reasoning about action (R&N sec. 10.4.2).
- Week 9 (Mar 8) Planning (R&N ch. 10, secs. 1, 2, & 4).
- Week 10 (Mar 15) Uncertain Reasoning (R&N ch. 13-14).
- Week 11 (Mar 22) Probabilistic Reasoning over Time (R&N ch. 15).
- Week 12 (Mar 29) Machine Learning (R&N ch. 18). No classes on Apr 2.
- Week 13 (Apr 5) Last day of classes, review.
Readings and Lecture Transparencies
- Week 1 (Jan 4) Introduction & intelligent agents
Required Readings: Russell & Norvig Chapter 1 & 2.
Lecture transparencies for Russell & Norvig Ch. 1,
lecture transparencies for Russell & Norvig Ch. 2,
instructor's lecture transparencies on Agents and MAS
- Week 2 (Jan 11) Uninformed Search
Required Readings: Russell & Norvig Chapter 3, Sec. 1 to 4.
Lecture transparencies part 1,
lecture transparencies part 2.
- Week 3 (Jan 18) Informed Search
Required Readings: Russell & Norvig Chapter 3, Sec. 5 and 6, and Chapter 4, Sec. 1.
- Week 4 (Jan 25) Game Tree Search
Required Readings: Russell & Norvig Chapter 5, Sec. 1, 2, 3, and 7.
- Week 5 (Feb 1) Constraint Satisfaction Problems and Bactracking Search
Required Readings: Russell & Norvig Chapter 6.
- Week 6 (Feb 8) Knowledge Representation & First-Order Logic
Required Readings: Russell & Norvig Chapter 8 (Chapter 7 is optional).
- Week 7 & 8 (Feb 22 & Mar 1) Inference in First-Order Logic
Required Readings: Russell & Norvig Chapter 9, Sec. 1, 2, and 5.
- Week 9 (Mar 8) Reasoning about Action
Required Readings: Russell & Norvig Chapter 10 Sec. 10.4.2. (in 2nd edition Chapter 10 Sec. 3)
Main lecture transparencies,
lecture transparencies from Brachman and Levesque.
- Week 10 (Mar 15) Planning
Required Readings: Russell & Norvig Chapter 10.
- Week 11 (Mar 22) Reasoning under Uncertainty
Required Readings: Russell & Norvig Chapter 13, and Chapter 14 Sec. 1 and 2.
Lecture transparencies from Brachman and Levesque.
A good Prolog text:
Clocksin, W.F. and Mellish, C.S.,
Programming in Prolog, (5th edition), Springer Verlag, New York, 2004.
Other good AI textbooks:
Poole, D., Mackworth, A., Goebel, R.
Computational Intelligence, A Logical Approach,,
Oxford University Press, New York, 1998.
Artificial Intelligence: A New Synthesis,,
Morgan Kaufmann, San Francisco, 1998.
On knowledge representation:
Ronald J. Brachman and Hector J. Levesque,
Knowledge Representation and Reasoning,
Elsevier/Morgan Kaufmann 2004, ISBN 1-55860-932-6
Knowledge representation, reasoning, and declarative problem solving.
Cambridge University Press, Cambridge/New York, 2003.
Genesereth, M.R. and Nilsson, N.J.
Logical foundations of artificial intelligence.
Morgan Kaufmann, Los Altos, CA, 1987.
On reasoning about action:
Knowledge in Action: Logical Foundations for Specifying and Implementing
MIT Press, 2001.
York Library eCopy,
Book home page.
Running SWI-Prolog in the Prism Lab
To run Prolog execute the command pl. To exit enter
at the prompt.
Documentation is available
on the web.