W3C home > Mailing lists > Public > public-rdf-shapes@w3.org > July 2014

Re: Shapes - sub-classes / sub-properties

From: Peter F. Patel-Schneider <pfpschneider@gmail.com>
Date: Wed, 16 Jul 2014 23:09:11 -0700
Message-ID: <53C76887.90701@gmail.com>
To: Jose Emilio Labra Gayo <jelabra@gmail.com>
CC: Simon Spero <sesuncedu@gmail.com>, Dimitris Kontokostas <kontokostas@informatik.uni-leipzig.de>, "public-rdf-sha." <public-rdf-shapes@w3.org>
On 07/16/2014 10:27 PM, Jose Emilio Labra Gayo wrote:
> On Thu, Jul 17, 2014 at 7:05 AM, Peter F. Patel-Schneider
> <pfpschneider@gmail.com <mailto:pfpschneider@gmail.com>> wrote:
>
>     On 07/16/2014 09:39 PM, Jose Emilio Labra Gayo wrote:
>
>         On Thu, Jul 17, 2014 at 5:48 AM, Peter F. Patel-Schneider
>         <pfpschneider@gmail.com <mailto:pfpschneider@gmail.com>
>         <mailto:pfpschneider@gmail.com <mailto:pfpschneider@gmail.com>__>> wrote:
>
>             [...]
>
>
>         I think you are right and Shape checking is more low level than constraint
>         checking in general. However, I also think there are plenty of practical
>         applications where one would like to have some way to declare the
>         shapes of
>         RDF graphs in a easy and automatically verifiable way.
>
>
>     Now we may be getting somewhere.
>
>     What are these practical applications that you think require shape checking?
>
>
> I think I already mentioned them in the previous email. They could be
> summarized as publish and develop RDF based applications, and consume and
> integrate data between different linked data portals.
>
> For example, I have found Shape Expressions are very helpful to specify the
> contents of the RDF graphs that I want to publish, so I can tell my team of
> developers that they have to produce graphs with those shapes...also, I have
> found that data portals documented with Shape Expressions can help consumers
> to know which are the shapes of the RDF graphs behind them.

Some specifics, and some examples would be very helpful here.  In particular, 
it looks to me as if ShEx cannot handle these use cases.

>     My canonical application for constraint checking is that I am writing a
>     program to consume RDF graphs, and I want to know that some information is
>     explicitly present in that RDF graph.  For example, I want to know that
>     each graduate student has a university explicitly given and that that
>     university is a research university.
>
>
> I think I have already done some shape expressions for that example or a
> similar one in another thread...it can be done with shape expressions as long
> as you are interested in the shape of the RDF graphs that you retrieve...

I have asked how ShEx can be used for this kind of constraint checking, and 
haven't got answers.  How would you use ShEx to provide this kind of service?

> Best regards, Jose Labra
>

peter
Received on Thursday, 17 July 2014 06:09:40 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 17:02:39 UTC