Lectures

Week 12

• Review questions:
  • week 11
• Lectures:
  • learning
  • (Non-examinable) Watch my talk at Google on data mining:
    Learning Defect Predictors from Static Code Attributes.

    Download slides: http://menzies.us/pdf/08google.pdf
    

Week 11

• Review questions:
  • week 10
• Lectures: natural langauge processing with Prolog
  • Gentle intro
  • More details
  • Time for the whole enchilada: the classic CHAT-80 system.
• And for the very very keen:
  • Pereira, Fernando. Logic For Natural Language Analysis, Technical Note 275. AI Center, SRI International, 333 Ravenswood Ave., Menlo Park, CA 94025, Jan 1983.
  • "This work investigates the use of formal logic as a practical tool for describing the syntax and semantics of a subset of English, and building a computer program to answer data base queries expressed in that subset. To achieve an intimate connection between logical descriptions and computer programs, all the descriptions given are in the definite clause subset of the predicate calculus, which is the basis of the programming language Prolog. The logical descriptions run directly as efficient Prolog programs."

Week 10

• Review questions:
  • week 8
• Lectures:
  • Logic programming with prolog

Week 8

• Review questions:
  • week 7
• Lectures:
  • From Co.Sci. to rules

Week 7

• Review questions:
  • week 6
• Lectures:
  • Handling uncertainty

Week 6

• Gaming 101

Week 5

• Review questions:
  • week 4
• Lectures:
  • No new examinable material this week- we will run with our existing material for a while.
  • But here are some non-examinable notes on:
    • cognitive science
    • the legacy of Joseph Weizenbaum (1923-2008).

Week 4

• Lectures:
  • 500-level: Balance agile and plan-driven methods
  • 400, 500-level: search
• LISP:
  • 400-level: Code for GameLand
  • 400,500-level: search.lisp

Week 3

• Review questions:
  • week 2
• Reading:
  • AI: proud, not smug
  • Chapters 2,3,4,5,6,10 of Graham
• LISP tutorials:
  • Polymorphism and simulation control using any.
  • The "any" code uses these structs.

Week 2

• Review questions:
  • week 1
• Reading: chapters 2-5 of Graham
• Demos:
  • ELIZA:
    • In Emacs, type "M-x doctor" and hit enter twice. Then tell Emacs about your childhood.
    • Once you understand what is going on, stop. Do not, under any circumstances, type "M-x psychoanalyze-pinhead".
    • If you want to peek inside ELIZA, look at the *eliza-rules* variable inside http://norvig.com/paip/eliza.lisp.
• Lectures:
  • Chapter 2 of Graham.
• LISP tutorials. Note: don't fret if you do not understand the following. Instead, just scan the code at 1000 feet and see what you can understand.
  • deftest.lisp
  • deftest example #1: random.lisp
  • deftest example #2: hash.lisp

Week 1

• Lectures:
  • What is AI?
  • Chapter 2 of Graham
• Review questions:
  • None yet.