W3C home > Mailing lists > Public > www-rdf-interest@w3.org > October 2004

Re: Troublesome relations

From: Reto Bachmann-Gmuer <reto@gmuer.ch>
Date: Tue, 19 Oct 2004 14:11:23 +0200
Message-ID: <4175046B.7000000@gmuer.ch>
To: Danny Ayers <danny.ayers@gmail.com>
CC: www-rdf-interest@w3.org

Danny Ayers wrote:
> [[
> This approach is the old argument that all relvars should be binary in
> a different guise! Thus, a cogent counterargument is:  How do you deal
> with irreducible n-order predicates for n <> 2?
> ]]
> The nearest I can get is in wondering perhaps if this is isomorphic
> with the way RDF predicates can't be treated as instances for
> per-usage qualification, you can't really go from predPQ(a, b, c) to
> predP(a, b), predQ(predP, c).

I'm probably just missing the problem, but can't just any n-order 
predicate like predPQ(a, b, c) be reduced to _1(resPredPQ,a), 
_2(resPredPQ,b), _3(resPredPQ,c)?

Received on Tuesday, 19 October 2004 12:11:28 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 15:07:53 UTC