CPSC 433 - Artificial Intelligence

Fall 2007

General Information

TA Tyson Kendon Office ICT 716
Time Tut 01 MW 1100 Location EDC 278
Office Hours TR 1300 - 1400

Notes

The directory with the slides has been put back where it belongs. I'm sorry for the inconvenience.

I have uploaded all the slides I changed for this year's class to the handouts section.

Those of you with final review questions may contact me (tjkendon@ucalgary) to set up an appointment to meet. I will also be in my office on Monday 10, 2007 from roughly 10:00 to 16:00 to answer questions.

Labs

September 17, 2007

Organization

  • We created groups and looked briefly at the assignment for the course.

September 19, 2007

Backus–Naur form

  • We went over BNF and the input format for the assignment.

September 24, 2007

Predicate Reader

  • We looked at Prof. Kremer's provided predicate reader and what extensions are needed to make this the basis of the assignment. The Environment needs to extend the predicate reader and implement the predicate methods, and will be the main class of your project. (Also not that it is not the Env in the Search Model definition.

September 26, 2007

Puzzle Example

  • We looked at solving a puzzle as an example of developing a search model and control. We solved the problem both with a set based paradigm and with a tree based paradigm.

October 1, 2007

Resolution

  • We looked at predicate logic resolution as an example of set based search.

October 3, 2007

Genetic Algorithms & the 0/1 - Knapsack Problem

  • We looked at the definitions for the Genetic Algorithm and how they fit into the paradigm for set based search. We then started the definitions for a Genetic Algorithm solution to the 0/1 Knapsack Problem.

October 10, 2007

0/1 - Knapsack Problem - the example continues

  • We finished defining the 0/1 Knapsack Problem and looked at a short example of our search control in action. We also started to define the 0/1 Knapsack Problem for a Branch & Bound Tree.

October 15, 2007

0/1 - Knapsack Problem - once more

  • We completed the 0/1 - Knapsack problem as a B&B Tree.

October 17, 2007

Assignment Questions

  • We took up questions regarding the assignment questions.

October 22, 2007

Midterm Review

  • We nearly examined Emycin, but I wasn't able to remember Bayes formula. We also looked at the role of the functions in the set based and tree based paradigms and their relation to transitions and the components in the states.

October 24, 2007

Midterm Review

  • We did a review of first order logic.

October 29, 2007

Prolog

  • We looked at the operation of prolog and an example . . . with ducks.

Oct 31, 2007

Or-Tree in Blocks World

  • We looked at an or-tree solution to a simple blocks world problem. We were able to achieve a goal configuration by branching each potential action branch to a new state.

Nov 5, 2007

XML Revisited

  • We fixed a broken XML file according to a DTD, we built a new DTD to describe a collection of CDs and DVDs.

Nov 7, 2007

EMYCIN revisited

  • We returned to the rule based system EMYCIN, how to process questions and what we can use if for.

Nov 14, 2007

Conceptual Dependency Diagrams

  • We looked at CD Diagrams as an example of semantic nets.

Nov 19, 2007

Assignment Questions

  • We talked about questions arising from the assignment

Nov 21, 2007

There was no lab.

Nov 26, 2007

Questions

  • Genereral question period, during which there were very few questions.

Nov 28, 2007

Perceptron

  • We will go over the perceptron model (however many people come).

Dec 3, 2007

Exam Review

  • If you have any questions you would like answered before the final, please send me an e-mail.

Dec 5, 2007

Cancelled

Site Updated: Dec 3, 2007 at 1630 MST