[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Problem with CLP

From: Lars Riis Olsen
Subject: Re: Problem with CLP
Date: Tue, 23 Sep 2003 20:58:29 +0200
User-agent: Mozilla/5.0 (Windows; U; Windows NT 5.0; en-US; rv:1.5b) Gecko/20030901 Thunderbird/0.2

Fergus Henderson wrote:

On 23-Sep-2003, Lars Riis Olsen <address@hidden> wrote:
So if I am understanding you correctly there is no way of determining whether a "yes" result returned by GNU Prolog is correct.

I don't know of any such way; but I don't know that no such way exists.
It might.  I'm not very familiar with GNU Prolog's constraint solving
support, so I don't know if it provides anything similar to SICStus
Prolog's call_residue/2 predicate (see below).

Anyone else have any thoughts on this?. The problem is that I need a constraint satisfiability package for a "proof-of-concept" implementation that I am doing as part of my masters thesis. It therefore needs to be free. For this reason GNU Prolog seemed like a perfect match, but if there is no way to circumvent the above limitation it really is quite useless for my specific purpose :(.

In that case, do you know of any free constraint satisfiability package(s), with a C interface, that does not have this limitation?.

I know that SICStus Prolog lets you distinguish these cases,
via the call_residue/2 predicate, which is documented at <>.

Unfortunately SICStus Prolog is not free.


reply via email to

[Prev in Thread] Current Thread [Next in Thread]