Course Home Page

Class Schedule

The class schedule is a guide to topics that will be discussed and when they will be discussed on a weekly basis. The week begins on a Monday.

All slide sets are files. To save paper and ink, I suggest you do not print slides too far in advance and not before the course begins as changes may be made.

Week 1: January 5 & 7

Readings: Chapter 1 Introduction to Prolog, Chapter 2 Syntax and Meaning of Prolog Programs, Chapter 3.1, 3.2 Representation and oprations on lists, & Chapter 8.1 .. 8.4 On programing style and technique
Slides:

• Administrvia Not worth printing, just for introductory class, contains pointers to the on-line information.
• Prolog introduction — ring.pl, tower.pl
• List utility predicates — listUtilities.pl

Week 2: January 12 & 14

Readings: Chapter 3.3 Operator notation, Chapter 3.4 Arithmetic, Chapter 4.1 Finding a Path in a Graph, & Chapter 6.2 Constructing and decomposing compound terms.
Slides:

• Prolog examples — examplePLunitTesting.pl
• Highlights of pattern matching
• Diagram for the maze example — maze.pl
• Defining operators — prefix unary, postfix unary and infix binary — engFrenchDictionary.pl, operators.pl

Week 3: January 19 (Report 1 due) & 21

Readings: Chapter 5 Controlling Backtracking, Chapter 6 Builtin Predicates, & Chapter 7 Constraint Logic Programming.
Slides:

• Cut and not — efficent execution – cuttest.pl
• Constraint logic programming — sendMoreMoney.pl, zebra.pl

Week 4: January 26 & January 28

Readings: Chapters 8.5 Improving Efficency (difference lists, holes and accumulators), & Chapter 9 Operations on Data Structures
Slides:

• Accumulators ‐ using stacks and queues to gather results – maze.pl, sortingAlgorithms.pl
• Diagrams for the binary tree example – binaryTree.pl

Week 5: February 2 (Report 2 due) & 4

Readings: Chapter 25.8 Simple theorem proving
       Chapter 23 Language Processing with Grammar Rules
Slides:

• Resolution method & theorem proving — the mathematical basis of Prolog

Week 6: February 9 (Class exam 1) & 11

Readings: Chapter 23
Slides:

• Chat program — using natural language to communicate with a program — chatBasis.pl, chatExample.pl, chatExampleInput.text
• Grammars — the mathematical basis of grammars, design and progrmming.

Week 7: February 23 & February 25

Readings: Chapter 11 Basic searchs: depth first, breadth first, iterative deeping, bidirectional
Slides:

• Basic search methods — c11_searchBasic.pl, f11*.pl.

Week 8: March 2 (Report 3 due) & 11

Readings: Chapter 12 Heuristic search and the A* algorithm.
Slides:

• Heuristic search methods — f12*.pl
• A* algorithm

Week 9: March 16 & 18

Readings: Chapter 13 Best-first search minimizing time & space
Slides:

• RTA* algorithm — f13*.pl
• IDA* algorithm — f13*.pl
• RBFS algorithm — f13*.pl

Week 10: March 23 (Report 4 due) & 25

Readings: Chapter 15 Knowledge representation and expert systems.
Slides:

• Expert systems — f15*.pl and other files in expert examples directory.

Week 11: March 30 (Class exam 2) & April 1

Readings: Chapter 16 Probabilistic networks with Bayesian reasoning.
Slides:

• Bayseian networks Why have them. What are they — examples in Bayesian network directory
• Bayseian networks: Defining probability equations

Week 12: April 6 & April 8 (Report 5 due)

Readings: Chapter 16 Probabilistic networks with Bayesian reaasoning.
Slides:

• Bayseian networks: Evidence nodes. d-separation & d-connection. Benefits & drawbacks
• d-separation example
• Bayseian networks: Model structure