RE: datatypes and MT (#rdfms-graph)

> ...The other proposals (S, DC and oldX=URV) don't need 
> this complication, however, since they can assume tidiness on literal 
> nodes as well as urirefs.

Can someone please point me to the most concise, prose definition
of tidiness as it relates to the graph?

Thanks,

Patrick

Received on Thursday, 15 November 2001 06:36:40 UTC