CPSC 433 - Artificial Intelligence
Winter 2008
General Information
| TA | Tyson Kendon | Office | ICT 716 |
|---|---|---|---|
| Time | Tut 01 TR 1600 | Location | ST 059 |
| Office Hours | By Appointment |
Notes
I have updated the handouts section again to include the conceptual dependency slides. Sorry for the delay, they slipped my mind.
I have updated the handouts section of the site to include my examples for Prolog, EMYCIN and the Perceptron. Please don't hesitate to contact me if you have any questions at all.
Labs
January 22, 2008
Organization
- We organized into groups and talked about the course in general. We also went over the functional and non-functional requirements of the assignment. If you were not able to attend the first lab please contact me for group assignment.
January 24, 2008
ELIZA
- We talked about ELIZA in general, a little bit about Turing tests, the Chinese room, and the ethics of mimicking humans.
January 29, 2008
ELIZA returns
- We looked at ELIZA's algorithm, rules and some more recent concepts. Examples include ALICE and Jabberwacky, you can find more in the resources section. Slides can be found in the handouts section.
January 31, 2008
Puzzle
- We looked at puzzle solving as an example of knowledge based search. We looked at the need for a Search Derivation, Search Model and Search Control. We also finalized group organization, if anyone has any question or problems with group organization please contact me.
February 5, 2008
Puzzle 2
- We started to go over a formal and precise definition of our puzzle problem. We concluded that a random search control was not going to helpfully solve the problem so we started to define functions to use as part of a smarter search control.
February 7, 2008
Puzzle 3
- We finished the definitions for the second and third search controls, for the first search model. We looked at example derivations for each of the controls. We also defined a second search model and control which extends the first model. The slides with the the examples (corrected, I think) are in the handouts section. Please let me now if there are still any errors.
February 12, 2008
Puzzle 4 / Genetic Algorithms
- We looked at an example search derivation with the second model. We briefly talked about the concept behind Genetic Algorithms and looked at them as an extension of set-based search. We wrote out the definitions for the search model and instance for the 0-1 Knapsack problem. The slides with the puzzle example (which I wrote out on the board) are available in the handouts section.
February 14, 2008
Branch & Bound Trees
- We finished the GA search control and look at a sample derivation. The slides with the example are in the handouts section.
- We also started the 0-1 Knapsack problem using a branch & bound tree. We covered the definitions for the search model, instance and control.
February 26, 2008
B & B Trees / Blocks World
- We looked at the example derivations, using two different search controls. We also spent some time reviewing definitions, looking at reasons behind a GA repair and the B&B bound function, and comparing the different search controls..
February 28, 2008
Assignment Questions
- We covered assignment related questions.
March 4, 2008
Or-Trees in Blocks World
- We looked at Blocks World and looked at using the or-tree to find a plan to go from one world state to another. Given that all the operations we used for the or-tree had a counter-part which reversed their actions, we were also able to see the link between or-trees and or-graphs.
March 6, 2008
Tic-Tac-Toe
- We looked at using an and-or-tree to give us a guide to playing tic-tac-toe.
March 11, 2008
Tic-Tac-Toe Again
- We looked at the process for finding a search control for the tic-tac-toe game.
March 13, 2008
Mid-term Review
- We covered some of the last minute exam prep questions.
March 18, 2008
Mid-term Discussion
- We went over the midterm, looking at unification, resolution and the and-tree long answer question. Expect more of the same on the final.
March 20, 2008
Logic
- We did some examples transforming English into propositional logic, and processing them. After that we transformed some sentences into First Order Logic. My slides are in the handouts section.
March 25, 2008
Logic Again!
- We finished looking at first order logic.
March 27, 2008
Prolog
- We looked at Prolog ... and ducks. Prolog and ducks and witches.
Page Updated: April 25, 2008 at 1410 MDT
