substitute MODULO predicate

Quote:

> Folks,

> I'm stuck with using a version of prolog that has NO modulo (integer

> division returning remainder) predicate. I REALLY need one. Does

> anyone know where I can get one?

If your prolog don't have mod (as in X is 1000 mod 7 ),

you can try:

M is A - (A//B)*B.

where // is the integer divide.

if you don't have //, use floor(), as in:

M is A - floor(A/B)*B.

--

Pascal