[m-dev.] The mode constraints branch summer project

Peter Hawkins peter at hawkins.emu.id.au
Fri Dec 24 09:40:41 AEDT 2004

On Thu, 23 Dec 2004 11:27 pm, David Overton wrote:
> On Thu, Dec 23, 2004 at 12:15:13PM +0000, David Overton wrote:
> > However the majority of the solving time was still spent with the
> > remaining ROBDD (conjunctions and if-then-else are rather common
> > constructs in Mercury programs!) so you may want to concentrate on a
> > replacement for these.  One complication is that the algorithm I used
> > for extracting the 2-SAT constraints is closely tied to the structure
> > of the ROBDD graph.
> One other thought.  Last I heard (which was about a year ago) Vitaly
> Lagoon was busy interfacing another ROBDD solver to Mercury which he
> claimed was much more efficient than Peter Schachte's implementation.
> You may want to check with him what state that is in.

Vitaly has an interface to the ROBDD library CUDD, which is an efficient C 
implementation of ROBDDs. There is a integer set CSP solver built on this 
interface. I can send you of the interface if you want it (~500 lines of 
mercury, ~1000 lines of C, library is ~70000 lines of C).

mercury-developers mailing list
Post messages to:       mercury-developers at cs.mu.oz.au
Administrative Queries: owner-mercury-developers at cs.mu.oz.au
Subscriptions:          mercury-developers-request at cs.mu.oz.au

More information about the developers mailing list