Path: utzoo!attcan!uunet!mcsun!ukc!tcdcs!swift.cs.tcd.ie!brady
From: brady@swift.cs.tcd.ie
Newsgroups: comp.lang.prolog
Subject: Re: The Craft of Prolog pp. 126-130
Message-ID: <7299.273583de@swift.cs.tcd.ie>
Date: 5 Nov 90 15:23:10 GMT
References: <4473@swi.swi.psy.uva.nl>
Organization: Computer Science Department, Trinity College Dublin
Lines: 24

In article <4473@swi.swi.psy.uva.nl>, anjo@swi.psy.uva.nl (Anjo Anjewierden) writes:
> I read:
> 
> 	Richard A. O'Keefe, "The Craft of Prolog", MIT Press 1990.
> 
> with great interest.  There is at least one section that may be
> inconsistent with statements made elsewhere in the book.  Section 4.4
> gives the following problem (the section is about reducing the
> search space):
> 
> The problem is as follows:
> 
> 	"D1, D2, ..., D9 are distinct decimal digits, none of them
> 	zero, such that for each 1 <= n <= 9 the n digits D1 ... Dn
> 	form a number which is divisible by n." [p. 126]
> 
> A Prolog program solving this problem is the following (I have paired
> the select/3 and divisible/2 calls inside answer/1):
>

I've been trying to run this to examine it. It's missing the select/3
clauses, & I don't have the book. Could you post them please?
Mike Brady