[m-dev.] semantics with any insts

[Peter Stuckey]

On 03/04/2006, at 12:33 PM, Ralph Becket wrote:

> Peter Schachte, Monday,  3 April 2006:
>> Say I'm implementing a cbool type.  I implement the common connectives
>> as "semidet" preds,
>
> Okay, so you're implementing and, or, xor, etc. as constraints.  In 
> that
> case I don't see how you can possibly implement, say, or(ia, ia) as
> anything other than nondet.  The only ones that can be semidet are 
> `not'
> and `and'.
>

Nope lookinto our Boolean solvers, they are all just constraints

in integer linear programming

	or(X,Y) :- X + Y >= 1

or
	
	Z = or(X,Y)
	or(X,Y,Z) :- Z >= X, Z >= Y, X + Y >= Z 

--------------------------------------------------------------------------
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
--------------------------------------------------------------------------