Path: utzoo!attcan!uunet!seismo!sundc!pitstop!sun!quintus!ok
From: ok@quintus.uucp (Richard A. O'Keefe)
Newsgroups: comp.lang.prolog
Subject: Re: The meaning of "declarative"
Message-ID: <687@quintus.UUCP>
Date: 16 Nov 88 10:52:57 GMT
References: <ALF.88Oct2184429@hathor.sics.se > <818@etive.ed.ac.uk> <590@dcl-csvax.comp.lancs.ac.uk> <859@etive.ed.ac.uk> <256@aipna.ed.ac.uk> <41315@linus.UUCP> <602@quintus.UUCP> <41581@linus.UUCP> <648@quintus.UUCP> <8326@burdvax.PRC.Unisys.COM>
Sender: news@quintus.UUCP
Reply-To: ok@quintus.UUCP (Richard A. O'Keefe)
Organization: Quintus Computer Systems, Inc.
Lines: 15

In article <8326@burdvax.PRC.Unisys.COM> lang@macbeth.PRC.Unisys.COM (Francois-Michel Lang) writes:
>Can somebody point to a reference for "iterative deepening"?

I picked up the idea from one of Stickel's papers about his
"Prolog Technology Theorem Prover".  I wish I had thought of it, but I'm
not that smart.  I _thought_ I had seen it in Judea Pearl's book
"Heuristics", but can't find it again (I may have been thinking of
"staged search").  Just at the moment I can't locate Stickel's paper
(if you could see my desk you'd know why!)  or I'd quote the reference
he gave.  The Handbook of AI describes depth-first search and bounded
depth-first search, and iterative deepening is just one controlling
the other...

Actually, looking at iterative deepening as a _factored_ search gives
you ideas about other ways of exploiting the basic idea.