[sc34wg3] Illustrating SIDPs

[Dmitry]

On May 4, 2004, at 2:30 PM, Patrick Durusau wrote:

> SIDPs (and, for that matter, OPs) can be arbitrarily complex.
>

That is what I cannot find in current TMRM. I see that SIDP can be 
defined as "combination of properties"  which I cannot call 
"arbitrarily complex".

TMCL on the other hand can express any equivalence function. I just 
think that TMCL is more general and powerful approach for defining 
equivalence classes. "Combination of properties" is a subset of 
possible equivalence functions.

Let's, for example,  introduce concept "ordered sets" in topic map.

With TMCL we can easily define following equivalence function:

Two topics of class "ordered set" are equivalent if they have 
equivalent members.

Can TMRM (using SIDPs) allow to disclose these kind of equivalence 
rules?

TMCL can do it because it allows to specify conditions such as "each X 
in P1(X) satisfies P2(X)" and use full power of logical operators.

Dmitry