DEPARTMENT OF
COMPUTER SCIENCE AND AI
PROBLEM SOLVING METHODS
IN ARTIFICIAL INTELLIGENCE
COURSE MATERIALS
Lecture Slides
Week 1: Prolog Review I
Week 2: Prolog Review II
Week 3.1: Prolog Review III
Week 4: Agenda-Based Search I
Week 5: Agenda-Based Search II
[.ps]
[HTML]
Week 6: Data Abstraction with Search Nodes
[.ps]
[HTML]
Week 7: Best First Search
[.ps]
Week 8: Project Description
[.ps]
Week 9.1: All Solutions Predicates
[.ps]
Week 9.2: Rule-Based Inference Systems
[.ps]
Week 10.1: Backward Chaining Interpretation Algorithms
[.ps]
Week 10.2: Forward Chaining Algorithms
[.ps]
Week 11: Generalised Forward Chaining Rules
[.ps]
Week 12.1: Truth Maintenance Systems: Reason Maintenance
[.ps]
Week 12.2: Truth Maintenance Systems: Implementation
[.ps]
Week 13.2: Constraint Propagation Systems (I)
[.ps]
Week 13.2: Constraint Propagation Systems (II)
[.ps]
Code Examples
Simple Algorithm for Agenda-Based Search.
Download
Backward Chaining Interpreters (Lecture 10.1)
meta2
Download
meta3
Download
meta4
Download
meta5
Download
Exercises
Prolog Exercise 1
Prolog Exercise 2
Previous Exam Papers
1997/98:
Test Paper (.ps)
;
Resit Paper (.ps)
COURSE HOME
UNIVERSITY
CSAI DEPARTMENT
Last modified: Fri Mar 12 18:13:59 1999