Holds iff the rational T1 is equal to the rational term T2.
?X
A rational term.
?Y
A rational term.
Description
The rational constraint solver checks to see if the equality can be
added to the constraint store. A modified Gaussian algorithm is used to
perform the test.
Fail Conditions
Fails if adding the constraint T1 $= T2 to the constraint store produces
an infeasible set of constraints.
Resatisfiable
No.
Exceptions
Examples
Success:
2*X + Y $= 16, X + 2*Y $= 17, Y = 6. gives X=5.
Fail:
4 $= 8/5.