My interest also piqued when I saw the amb example in rosettacode. It seems
like that could be combined with something to backtrack if a permutation
goes out of bounds.

http://www.randomhacks.net/articles/2005/10/11/amb-operator

On Thu, Jul 26, 2012 at 12:21 PM, Joe Bogner <joebog...@gmail.com> wrote:

> Thank you. My researched suggested that it was possible with other prolog
> implementations so I wasn't sure if I was missing something simple in pilog.
>
> I also wasn't sure if with a simple problem space I could combine
> something like permute with a known range of possibilities. In the example
> below, I could generate a list of the whole numbers from 1-100 for the
> acreage and then have some helper functions to test for ranges. I wouldn't
> need to solve for a real number.
>
> It sounds like there are better ways to do it. I was hoping to come up
> with something as nicely declarative/expressive as pilog that didn't have a
> bunch of conditionals. I could probably use some dsl though. I have no
> experience with pilog and was interested in an application of it.
>
> Thanks again
>
>
>
>
> On Thu, Jul 26, 2012 at 11:31 AM, Alexander Burger 
> <a...@software-lab.de>wrote:
>
>> On Thu, Jul 26, 2012 at 04:02:07PM +0200, Henrik Sarvell wrote:
>> > I can't say for sure if prolog is a good fit or not. The problems seems
>> a
>> > little bit too arithmetic maybe but do not trust my word on it.
>>
>> I also don't think that Prolog or Pilog are well suited for that.
>>
>> Linear programming is an optimization technique, often employing the
>> simplex algorithm where you solve a number of linear equations by
>> "pivot"ing their terms. I think this can be easier solved in plain Lisp
>> than in Pilog.
>>
>> Cheers,
>> - Alex
>> --
>> UNSUBSCRIBE: mailto:picolisp@software-lab.de?subject=Unsubscribe
>>
>
>

Reply via email to