Logic Programming (Prolog) Slides (PDF Format)


Introduction to Logic Programming:  Click here.

Prolog's Version of READ-EVAL-PRINT:  Click here.

Example - Family Relationships:  Click here.

The Factorial Computation (done symbolically):  Click here.

The Factorial Computation (arithmetically computed):  Click here.

Prolog's Parameter-Passing Mechanism - Unification:  Click here.

Appending Lists in SCHEME and in Prolog:  Click here.

A Simple Insertion Sort:  Click here.

Rules for a Maximum Computation (w/o diagrams):  Click here.

Search Space Diagrams for a Maximum Computation: 
   Page 1: Click here.
   Page 2: Click here.
   Page 3: Click here.

Quicksort in Prolog:  Click here.

An Example of Formula Simplification (DeMorgan's Laws):  Click here.

An Example of Formula Simplification (Other equivalence laws):  Click here.

Mergesort in Prolog:  here.

The not and setof Predicates:  Click here.

Negation as Failure:  Click here.

Game Playing with Minimax:  Click here.

Tic-Tac-Toe:  Click here.

Using Parameters to Accumulate Answers:  Click here.

The 8-Queens Problem:  Click here.

The Knightstour Problem:  Click here.

More on Cut, Redundancy, setof, and bagof:  Click here.

Translating Base 10 to Roman Numerals Click here.