Path: utzoo!mnetor!uunet!munnari!vuwcomp!lindsay
From: lindsay@comp.vuw.ac.nz (Lindsay Groves)
Newsgroups: comp.lang.prolog
Subject: Re: mine embarrassingly simple problem
Message-ID: <13364@comp.vuw.ac.nz>
Date: 17 Mar 88 03:49:59 GMT
References: <500@taux01.UUCP> <764@cresswell.quintus.UUCP> <503@taux01.UUCP>
Reply-To: lindsay@comp.vuw.ac.nz (Lindsay Groves)
Organization: Comp Sci, Victoria Univ, Wellington, New Zealand
Lines: 21

In article <503@taux01.UUCP> shahaf%taux01@nsc.COM writes:
>In article <764@cresswell.quintus.UUCP> ok@quintus.UUCP (Richard A. O'Keefe) writes:
>>
>>(4) Could you tell this newsgroup more about your program?  It would be
>>    very interesting to hear of something that ancestral cuts were
>>    needed for.  (They _aren't_ needed for interpreting Prolog!)
>The program does Network synthesis from boolean equations for VLSI design.
>The ancestral cut  was used to stop the search of local transformations
>when the rate of new maping is too low.
>shahaf%taux01@nsc.COM

I'll save Richard saying it -- this doesn't say much about the program, and 
certainly doesn't explain why ancestral cuts are supposed to be necessary.
Could you describe the problem in a bit more detail and illustrate just 
how the need for ansectral cuts arises?  Perhaps a simplified version of the
problem could be used to illustrate the point.  An example would certainly 
help.

	Lindsay Groves

	Logic programmers' theme song: "The first cut is the deepest"