- From: Holger Knublauch <holger@topquadrant.com>
- Date: Wed, 25 Mar 2015 11:58:16 +1000
- To: public-data-shapes-wg@w3.org
On 3/25/15 1:35 AM, Peter F. Patel-Schneider wrote: > -----BEGIN PGP SIGNED MESSAGE----- > Hash: SHA1 > > I believe that the current design of SHACL > (https://w3c.github.io/data-shapes/shacl/) will make recursive shapes very > problematic. > > Both variations in > http://w3c.github.io/data-shapes/shacl/#sparql-AbstractValueShapePropertyConst > raint > do not work correctly. (Consider how the designs would work on the SHACL > versions of the examples in > https://lists.w3.org/Archives/Public/public-data-shapes-wg/2015Mar/0377.html.) In that email, is the issue due to the combination of sh:valueShape with OrConstraint? In the quick prototype that I published on Monday, I have changed the logic so that it throws an error when the same node/shape combination is reached for the second time within the same recursion, see line 53 of https://github.com/HolgerKnublauch/shacl-lite/blob/master/src/org/topbraid/shacl/lite/SHACLLiteConstraintValidator.java Would adding such a clause to the spec help? (Sorry if this was discussed before, I was not able to dedicate sufficient attention to the various ShEx-related emails on this topic). Otherwise, how do you propose we proceed on the sh:valueShape topic? Thanks, Holger > > Does anyone have a proposal on how to handle recursive shapes that does not > give rise to difficulties? > > > peter > > -----BEGIN PGP SIGNATURE----- > Version: GnuPG v2 > > iQEcBAEBAgAGBQJVEYRJAAoJECjN6+QThfjzKnsIAIJrI9dGR076qUc0FesGLqXy > 86m8sE5FaSRlwO6v/vaKNBl/GvMP6o6qMibjRjFR/YOfUK7p19KIClqj8XSB07kz > zIF04i9HRoqeCcb4CRZoNlqV6OKND7SyfHB0pDdccYh2g8kvLIk1/60DtUXt0599 > n0tPPzmPLdkOSLsMmiklCFnvthj0tEY+l6lWG7tOKDrupQTQCbIgnQ/bOU6Xrv+B > pJExCrEdSvURYL1z9/BsGlz431X91Ga97J0hmhe842Mi79Dd2zk7VkKXurRKJm63 > Z2EPBz9TD0P0dzxh/JcszDCxRND+G3C7oRPglfc1RP5+P1Zd3QqNltpIIQSh6J4= > =c37i > -----END PGP SIGNATURE----- >
Received on Wednesday, 25 March 2015 01:58:54 UTC