Congrats to Franz again on GRUFF! If I were more emotional I would weep with joy over the perfection of the reification display!
I haven't seen another graph display that gets statement reification right, so I consider this a big moment in the semantic community.
I've met lots of reification haters out there and this will go along ways toward healing their notions. Using Prolog instead of SPARQL will, of course, do much. Then they just need to understand that it doesn't have to be slow. At my last position with our home-brewed architecture, we were running queries of 70 BGP's and each one of the BGPs was reified with provence. Our customer required that we query using the provenance on every statement/BGP. We had compact quads. We loaded bloated non-compact reification - in the name of W3C compliance. Which seems silly when we could have used statement-ID-based nquads like I'm trying to do now.
Franz is working now on loading compact quints (<s> <p> <o> <g> <tid>) from files, but it is presently very doable using proceedural code.
Superbness! Great reification display!
Please see my attachment. It is meant to encode "This morning, Jim planned on running to Costco before 6:00."