- From: Olaf Hartig <olaf.hartig@liu.se>
- Date: Tue, 10 Oct 2017 21:58:06 +0200
- To: <public-prov-comments@w3.org>
- CC: "Svensson, Lars" <L.Svensson@dnb.de>
Hi Lars, There is another approach that we are currently working on. It goes by the name RDF* and SPARQL*. The basic idea is to allow for nesting of triples and, similarly, nesting of triple patterns in queries. Find a short, 4-pages description of the proposal and of our initial results in the following document: http://olafhartig.de/files/Hartig_ISWC2017_RDFStarPosterPaper.pdf The document also includes pointers to more detailed documents. Let me know if you have any questions about it. Best, Olaf On tisdag 10 oktober 2017 kl. 12:59:10 CEST Svensson, Lars wrote: > Dear all, > > This might be a question that has been asked before, but I couldn't find > anything in the list archives. Please just direct me to the previous > discussion, should there be one. > In my application I want to make assertions about a specific triple in my > RDF graph. The creation of the provenance graph is fairly straightforward, > but I'm still at odds how to attach the provenance graph to the triple. So > far I've found two ways of doing this: 1) Reifying the triple and then > attach the provenance graph to the rdf:Statement. 2) Creating named graphs > (possibly one per triple) and attach the provenance graph to the graph > identifier. > Are there any other ways or best practices on how to do this? > > Thanks for any insight, > > Lars > > *** Lesen. Hören. Wissen. Deutsche Nationalbibliothek *** > -- > Dr. Lars G. Svensson > Deutsche Nationalbibliothek > Informationsinfrastruktur > Adickesallee 1 > 60322 Frankfurt am Main > Telefon: +49 69 1525-1752 > Telefax: +49 69 1525-1799 > mailto:l.svensson@dnb.de > http://www.dnb.de > >
Received on Tuesday, 10 October 2017 19:58:39 UTC