- From: Peter F. Patel-Schneider <pfpschneider@gmail.com>
- Date: Tue, 19 May 2015 13:26:36 -0700
- To: public-data-shapes-wg@w3.org
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA256 I don't understand why Well defined schemata are defined so closely. Definition [Well defined schema] A shape expression schema S is called well defined if for all negated shape label !T in negshapes(S), the corresponding dependency sub-graph dep-subgraph(T, S) is a directed acyclic graph. This excludes any schema where a negated shape references a recursively-defined shape, even if that shape does not involve negation in any way. Is this required? Would it be possible to instead just say that in a well-defined schema there can be no loops involving negation? peter -----BEGIN PGP SIGNATURE----- Version: GnuPG v2 iQEcBAEBCAAGBQJVW5x8AAoJECjN6+QThfjzA2wH/A2CAjQjJSH3W8rhgw+maTI2 IfFiINZtpkqYY+c17DRmZ/MXFJ1bjjGLyLSkRqIX64bNVtxegXm9Pve5eRTmx4Zo w15/vUANTW1/IjvJeb1gswyolJgbtel9iptLEbnhq34D0svIzuqMzW6hq/dWztKf axXWnZEpeQvKv1tyJSRPQQLRXvAjsL+EzA5a6LUa3T1m9yBPxGtuFg8DQqMEl7uh c8t8xCk3fiP2APA6i/dRbrDeQbrrXJiSevXSghDMKRdi1eedkbaQOat0OMS5xF42 7oIzfE/RdJ/SFHnZ1acQX0SYWsbjqna6Uw/fbluZPfd8JcAuNn83l/ReLdlF+nk= =tOmc -----END PGP SIGNATURE-----
Received on Tuesday, 19 May 2015 20:27:05 UTC