W3C home > Mailing lists > Public > public-data-shapes-wg@w3.org > March 2015

Re: Comments on Draft #2

From: Arthur Ryman <arthur.ryman@gmail.com>
Date: Wed, 18 Mar 2015 18:43:53 -0400
Message-ID: <CAApBiOktd3JxL5SQB+OmSbRN6Ksopp3EvS0sx0y1o0B44cuQHA@mail.gmail.com>
To: Irene Polikoff <irene@topquadrant.com>
Cc: Karen Coyle <kcoyle@kcoyle.net>, "public-data-shapes-wg@w3.org" <public-data-shapes-wg@w3.org>

You understand exactly. SHACL should support general, disconnected
graphs. However, OSLC Resource Shapes does not. It assumes there is an
initial root node and only let's you express constraints that are
rooted at nodes that can be reached from the initial root node by
traversing properties in the forward direction. SHACL must avoid this

-- Arthur

On Wed, Mar 18, 2015 at 6:10 PM, Irene Polikoff <irene@topquadrant.com> wrote:
> <It
> illustrates a real-world example where one cannot navigate from a
> starting node to all other nodes.>
> I am not quite sure what is special about this concept. I do not believe
> that in general one can assume that given a set of triples (a graph),
> there will be a node from which all other nodes in the graph could be
> reached.
> Am I missing something?
> On 3/18/15, 5:40 PM, "Arthur Ryman" <arthur.ryman@gmail.com> wrote:
>>illustrates a real-world example where one cannot navigate from a
>>starting node to all other nodes.
Received on Wednesday, 18 March 2015 23:07:47 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 19:30:18 UTC