Class 35: Expert Systems

Held Wednesday, April 5, 2000

Overview

Today, we consider the predicate calculus and how it is used to implement ``intelligent'' systems.

Question 35 for discussion today: Model some set of relationships (preferably something other than family trees) with the predicate calculus.

Question 36 for discussion on Friday: Model some set of relationships (preferably something other than family trees) with the predicate calculus.

Notes

• Read Dewdney 27 (Perceptrons) and 36 (Neural Networks that Learn)
• Since so many of you had problems with today's question, I'm giving it to you again.

Contents

• A Computer Psychologist
• The Predicate Calculus, Revisited
• Reasoning with the Predicate Calculus: Family Trees

Summary

A Computer Psychologist

These notes are adapted from notes from Henry Walker.

• In a dtterm window, type emacs
• When emacs opens, type [Esc] X doctor. Note that the [Esc] is the key at the upper-left side of the keyboard.
• Start conversing with Eliza. Type the [Enter] key twice after each of your responses.

• We'll spend a few minutes talking about Eliza, what it's like to interact with Eliza, and what possible algorithms might underlie Eliza.

The Predicate Calculus, Revisited

• We'll try looking at this issue from a slightly different perspective: What did you learn from the chapter?

Reasoning with the Predicate Calculus: Family Trees

• A predicate often models a relationship. What better relationship than family trees?
• We'll start with some basic rules and then see how we might automatically reason with those rules.