Compilers for breadth first search and bottom up computation ?

Article View: comp.lang.prolog

Article #584

#584

From: Philipp Hanschke Dfki
Date: Fri, 19 Jan 1990 08:41

14 lines
1075 bytes

In Article <2313@cs-spool.calgary.UUCP> John Cleary wrote:

> The easiest way to do a breadth first search is to use a bounded depth search
> where the depth is increased after all the solutions at the earlier depth are
> found.  It is straightforward to write an interpreter to do this, and if
> you are a little more bold you can even compile away the interpreter.

I am generally interested in implementing breadth first search and bottom up 
computation by compilation or program transformation for PROLOG-like languages.
References and fresh ideas will be appreciated.

Thanks in advance.

         Philipp Hanschke

Technical Details

Message-ID: <8038@uklirb.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!cs.utexas.edu!uunet!mcsun!unido!uklirb!hanschke

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!cs.utexas.edu!uunet!mcsun!unido!uklirb!hanschke
From: hanschke@uklirb.UUCP (Philipp Hanschke Dfki)
Newsgroups: comp.lang.prolog
Subject: Compilers for breadth first search and bottom up computation ?
Message-ID: <8038@uklirb.UUCP>
Date: 19 Jan 90 08:41:04 GMT
Reply-To: hanschke@uklirb.UUCP (Philipp Hanschke Dfki)
Organization: University of Kaiserslautern, W-Germany
Lines: 14