Last updated 2015 April 13

Class times: Section M: Mondays & Wednesdays, 5:30pm to 7:00pm, Room CB 115

## 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:

### 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:

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

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

### 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:

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

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:

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

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

### Week 9: March 16 & 18

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

### 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:

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

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