CPSC 433 - Artificial Intelligence

Handouts

Tutorial 5 [ppt] - Set based puzzle examples for the 2nd and 3rd search controls
Tutorial 6 [ppt] - Tree based search model for the puzzle example
Tutorial 7 [ppt] - Colour GA description and 0/1 Knapsack problem
Tutorial 8 [ppt] - Branch and Bound 0/1 Knapsack problem
Tutorial 10 [ppt] - Definition for our TSP B&B.
Tutorial 11 [ppt] - A graphical representation of the search space for our B&B example.
Tutorials 16/17 [ppt] - Phrases to be converted to FOL, examples of Modus Ponens, Conversion of WFFs to CNF and a big example. Note there are some typos here, please use with caution.
Tutorial 18 [ppt] - How Prolog processes facts with resolution and important information on witches and ducks.
Tutorial 19 [ppt] - EMYCIN example, use this to determine which of your friends is making it snow.
Tutorial 20 [ppt] - A short example DTD for an XML document and a practise XML document to find the errors.
Tutorial 21 [ppt] - Examples of some conceptual dependency graphs. These are somewhat beyond what you will need to know for the final.
Tutorial 22 [ppt] - The perceptron model of neural nets. A sort example to show the perceptron updating rule in action.