- From: Holger Knublauch <holger@topquadrant.com>
- Date: Fri, 19 Jun 2015 08:28:47 +1000
- To: public-data-shapes-wg@w3.org
On 6/19/15 6:19 AM, Peter F. Patel-Schneider wrote: > -----BEGIN PGP SIGNED MESSAGE----- > Hash: SHA256 > > I propose that SHACL not require that the shape graph be accessible when > evaluating constraints on the data graph. I feel that this allows for > effective use of SHACL on more common use cases, including those that use > remote graphs such as graphs only accessible via SPARQL endpoints. ?shapesGraph access is used in the current spec. If you want to drop this, you need to present a worked-out counter proposal on how this can be done without such access. > SHACL > does not require that the shape graph be accessible when evaluating > constraints on the data graph because it is possible to write self-contained > queries for all approved SHACL requirements. Not correct. The requirements do not exclude recursion from sh:valueShape, therefore recursion should be supported - at least we should make honest attempts to resolve it, and not use this as an excuse to push a specific implementation strategy. Holger
Received on Thursday, 18 June 2015 22:29:21 UTC