[m-dev.] Solvers, negation, existential quantification, and so forth
Ralph Becket
rafe at cs.mu.OZ.AU
Mon Jun 5 16:20:32 AEST 2006
Mark Brown, Monday, 5 June 2006:
> On 05-Jun-2006, Ralph Becket <rafe at cs.mu.OZ.AU> wrote:
> >
> > I have real difficulty believing this: my intuition is that the cases
> > where you can be accurate will be rare.
>
> I notice you cleverly snipped the last sentence off my paragraph. ;-)
Oh, all right then!
> Anyone have any good examples that demonstrate otherwise?
I have large problem cases: any programs using SAT solvers and most
programs using LP :-)
--------------------------------------------------------------------------
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