I have two series of constraints S and S', they describe possibly infinitely large sets. Say for example
x <= 10 and y <= x and
x <= 20 and y <= 20. Now I want to know if
S is a subset of
I thought I could try to solve something like:
S' and not (S and S'), if it couldn't find a solution S is a subset of S'.
How would I put this in prolog, is this a reliable solution? I am using gprolog but I can switch to another implementation.