Originally posted by: heidizh

S is a set of nodes. I want to express that i belongs to  S while j does not belong to it. How to express it using CPELX?

Let me explain it more explicitly. V is a set of nodes. S represents an arbitrary set of nodes, and S belongs to V. How to express it when i is in S and j is not S but in V?

Hi,

let me give you an example of in and not in:

{string} nodes={"A","B"};

string s1="A";
string s2="C";

assert s1 in nodes;
assert s2 not in nodes;

regards

Originally posted by: heidizh

Thank you very much! Actually, I  want to express a constraint somehow different from the example you give. Please check it in the attachments. Thank you.

Originally posted by: heidizh

Let me explain it more explicitly. V is a set of nodes. S represents an arbitrary set of nodes, and S belongs to V. How to express it when i is in S and j is not S but in V?

forall(i in S,j in (S diff V)) ?

but if what you want to express is for all S subset of V then this is something else

regards

Originally posted by: heidizh

Thank you, Alex. 

You guess it. What i want to express is for all S subset of V,  can you help me express it?

Originally posted by: max__x

Hello, Heidizh

Have you solve the problem you got?

since  I am facing the same problem as you, if you solved it, could you tell me how to do it.

I will very appreciate it!