- From: Karen Coyle <kcoyle@kcoyle.net>
- Date: Sat, 03 Jan 2015 07:46:05 -0800
- To: public-rdf-shapes@w3.org
On 1/1/15 1:35 PM, Judson Lester wrote: > I wound up defining a vocabulary of "paths" in RDF that could be used to > match parts of a graph, something like regular expressions match strings. This sounds like the approach taken by the Dublin Core Description Set Profile.[1] It has some advantages (you can overlay graphs of any type), and some disadvantages (the graph shape may not be coincident with the graph meaning, especially when you have errors like missing properties). I have a hard time thinking of this in the abstract, so some real examples would be good. Can you provide any? kc [1] http://dublincore.org/documents/dc-dsp/ see section 3 for matching rules -- Karen Coyle kcoyle@kcoyle.net http://kcoyle.net m: 1-510-435-8234 skype: kcoylenet/+1-510-984-3600
Received on Saturday, 3 January 2015 15:46:16 UTC