Re: Higher-arity to RDF binary

Dear all,

In reference to http://www.w3.org/TR/swbp-n-aryRelations/,
suppose we define:
"... the formula DescPr(*d, p, o*) , asserting that object *o* is a value of
property *p* in description *d*. ..."

and we have:
DescPr(*d, p, o*)
DescPr(*d', p, o'*)

the above formula could be represented by RDF like:

:d
       a                           :DescPr_description ;
       :has_property       :p .

:d'
       a                            :DescPr_description ;
       :has_property        :p .

:p
       a                          :DescPr_property ;
       :has_value           :o ;
        :has_value           :o' .

>From these triples how can we go back in a unique way to the logical
representation.

Thanks,
Jitao