TA contact information:  Marcin Pilat (pilat@cpsc.ucalgary.ca), office: ICT748 (please email to schedule an appointment).

The main course page can be found at: http://pages.cpsc.ucalgary.ca/~denzinge/courses/cs433-fall2004.html .
Also, you can have a look at the tutorial web page of Al Fedoruk (the other TA for the course).
 

Note: The student society course review will be held on Friday at 6-8pm in ICT121.  The review will be conducted by Al - the TA for the other section.  You can go there to listen to the review and ask still unanswered questions.

December 6/8: Review for the exam.

November 29/December 1: Neural networks - perceptron and beyond.

November 24: We will spend some time on semantic nets.

November 22: Will be talking about the idea of frames and example of XML and DTDs.  See notes & references below.

November 15/17: We will be doing some MYCIN examples. See notes below.

November 10: We will take a look at PROLOG and do a few examples.  See notes below.

November 8: We will continue with FOL examples.  We can also take a look at the midterm questions now that everyone had a chance to see the midterms. 

November 3: Continue looking at first order logic examples.  Examples consist of converting english phrases into FOL, then clause form, then solving them using resolution refutation.  See notes section below.

November 2: If your group would like to use the CVS system for source management of your project (recommended for a group project), the information is available on this page.  Also see the references section at the bottom of this page.

November 1: We will take a look at examples of knowledge representation (namely first order logic examples).

October 29: Midterm exam at 17:00 in ENE 241!

October 25/27: I will be around to answer questions regarding the posted sample midterm (see notes below).

October 22: Remember that your project proposals are due at noon!

October 20: We will take a look at planning with STRIPS (see notes below).

October 18: We will go over an example of OR trees (constraint satisfaction problem) (from the two chapters).

October 13: We will finish up with your resolution example and present an example of AND trees (0/1 knapsack problem using branch-and-bound) (from the two chapters).

October 6: This lab will be used to review some necessary logic and revisit the resolution example of set-based search.

October 4: We will continue with the GA example of the 0/1 knapsack problem.  We also might start with the logic review if time permits.

September 29: We will cover an example of set-based search by introducing the 0/1 knapsack problem.

September 27: We will continue to look at the puzzle example.

September 22: We will go over the definitions of a search model, search instance, and search process and present a puzzle example (from the two chapters).

September 20: We will go over the assignment and talk about intelligence.

September 15:  Tutorial time will be used for discussions within groups.
 

November 22: The XML example covered in the labs can be found here.

November 17: The MYCIN example of "Joe passing" is here.  Al will also post an example with the witches.

November 10: The Prolog Monty Python's example can be found on Al's page.

November 3: Al has posted the solutions to the examples that we looked at in the labs.  They can be found at: Alpine Club and Green.  Rules to convert FOL sentences into clause form can be found here.

October 28: Additional notes on theorem proving can be found here.  Make sure you take a look at them before the midterm since they explain the process that we want you to use on the midterm!

October 22:Questions to help you prepare for the midterm will be posted on the main course webpage by this date. Make sure you go over them before our labs for the following week.

October 20: Nice short introduction to STRIPS can be found here.  Slides about the block world example can be found in this document (section 2.3).

October 6: For a nice introduction to predicate logic, unification, and resolution, you can consult the Logic, Programming and Prolog downloadable book.  We will be using some of the examples from this book in the labs.

September 20 :  The ELIZA notes covered in class can be found within these slides (section 2.1).  Some information about the Turing Test.  The original ELIZA paper can be found here and an interactive implementation here.  You can also chat with a new bot called Alice which won the Loebner price over the past few years.

• It is strongly suggested that you familiarize yourself with the contents of the two chapters posted by Dr. Denzinger (the download is restricted to the university domain). 
• We will be stressing the use of a source/version control system (CVS) that is set up by our department for the use of the students in this course (more details to come).  Some documentation on CVS can be found here.
• For your project document, we will strongly recommend the use of LaTeX.  You can have a look at a short introduction to LaTeX.  Under Windows, you can use a LaTeX package called MikTeX.
• The language that you will be using for your implementation of the project will be JAVA.  Al has provided some nice coding standards that you should familiarize yourselves with.
• You can find some useful resources on paper writing and presentations through this link.
• Information on XML and DTD can be found at xmlfiles.com or w3schools xml tutorial .