- From: Peter F. Patel-Schneider <pfpschneider@gmail.com>
- Date: Wed, 24 Jun 2015 10:22:16 -0700
- To: RDF Data Shapes Working Group <public-data-shapes-wg@w3.org>
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA256
The behaviour of http://w3c.github.io/data-shapes/semantics on simple
negated recursive shapes is quite bizarre.
Consider
S = { s closed ex:r !s [1;1] and ^ex:r iri [1,1] }
on graphs of the form
Gn = { ex:i1 ex:r ex:i2 .
ex:i2 ex:r ex:i3 .
... .
ex:in ex:r ex:i1 . }
The valid typings for these graphs appear quite random and also quite
computationally difficult to determine.
peter
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v2
iQEcBAEBCAAGBQJViudIAAoJECjN6+QThfjzcuEH/3rJdR/36b6n9ylOscJ7Tm2K
UHgDy9bo9ntArUHt2cucjy1/5GtSWlZsbj5Xr82/pcu1g9CTdUhpYfk14laKp3l9
Hb/XHZ6NmqKAoA6gVnwF6T/O/UIUY+RNF731PSLHTkn4t3FHaUnDrOfL2qbYiSC9
DRzcgVh/neCHwgSpoFQzV+4kqeheNv5T7p1LslGRNNfP3xiUxg6E73HIF4VYzaoh
Qb9Iz1XZkxOVoUez5Vxlmqq3XpKBzzWTXOZ0uSAYujRzNyX6jPuSk8Shwkf1/w0v
ZLpG5gpoJmn5bSCthTrFMRHBU27T0We1h9Q+Igv+uuGHNigoC/+U8OmZhyU/m24=
=W74G
-----END PGP SIGNATURE-----
Received on Wednesday, 24 June 2015 17:22:52 UTC