Re: statements about a graph (Named Graphs, reification)

As a minor point, I don't think that the reification semantics are  
undefined. Rather they are well defined, but extremely weak. However,  
the end result, not useful for interoperability, is, I think, the  
same. As for public use of reification, the current OWL 1.1 proposal  
uses it in the RDF translation for axiom annotations. http:// 
www.webont.org/owl/1.1/

-Alan

On Sep 4, 2007, at 3:53 AM, Richard Cyganiak wrote:

> There isn't really any hope of getting interoperability with  
> reification, no matter what way you use it, because its semantics  
> are undefined and different people tried to use it quite  
> differently. You'll have trouble finding any published RDF that  
> uses reification, though some applications use it to good effect  
> internally.