C H A P T E R N I N E Logic Programming

Attempting to Satisfy the Query talkswith (bob, allen) Figure 9.1

First Attempt to Satisfy the Query talkswith(Who, allen) Figure 9.2

A Partial Family Tree Figure 9.3

A Small Family “Tree” Figure 9.4

Partial Search Tree for append([english, russian], [spanish], L) Figure 9.5

Trace of bsort for the List [5,2,3,1]. Figure 9.6

The Factorial Function in Prolog Figure 9.7

Trace of Factorial (4) Figure 9.8

Symbolic Differentiation Rules Figure 9.9

Prolog Symbolic Differentiator Figure 9.10

Search Tree for the Query d(x, 2*x+1, Ans) Figure 9.11

Prolog Solution for the Building Problem Figure 9.12

A Simple BNF Grammar and Parse Tree for “The Giraffe Dreams”† Figure 9.13

Tracing Execution of a Prolog Query Figure 9.14

Prolog DCG for the Syntax of Jay Expressions Figure 9.15

Jay Expression Syntax Extended to Generate Parse Trees Figure 9.16