- From: Peter F. Patel-Schneider <pfpschneider@gmail.com>
- Date: Mon, 15 Jun 2015 06:35:52 -0700
- To: Holger Knublauch <holger@topquadrant.com>, public-data-shapes-wg@w3.org
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA256 On 06/15/2015 12:22 AM, Holger Knublauch wrote: > On 6/15/2015 16:32, Peter F. Patel-Schneider wrote: [...] >>>> Do you have any other example of non-determinism? > With recursion through negation, the order in which objects are selected > during shape recognition can affect results in systems that handle loops > by memoizing, even with only two values. Consider a shape like S = all R > not S and a graph like V1 R V2 . V2 R V1 . Starting with V1 makes V1 in S > and V2 not. Starting with V2 makes V2 in S and V1 not. > > Examples like this have been discussed already. > >> Wouldn't this problem be resolved by disallowing memoizing? sh:hasShape >> is our own function that we can define in whatever way we want. Some form of memoizing is needed in procedural approaches to recursion so that loops terminate. >> Holger peter -----BEGIN PGP SIGNATURE----- Version: GnuPG v2 iQEcBAEBCAAGBQJVftS4AAoJECjN6+QThfjz+jAH/jkz/UD513S9ZPwPPJH+998G dLLlWlKMGg5AJj842OGHYEZ/BqJaKtZBOvlGD+Gd8upnil2i2AOdf90tMcjj1pB2 FiJqJqOnRxkRxNWy0IIfLLVYwnQNcGBnb5/zwPykVJbFDFGxcz61xhRyr/oKGeEd 8Khprxdk7UbKVJAr5Tg5kCf4szZ+QAznmsRi4la5TKhpJ300EfOJCGbwhW/RGqFa wmHKQEK2n4cmX/3qkojlPY2euF+VoUD7TIHY3Vi94nbSb70IxMhm2VdVRhMthDu+ C9bANYMs2NO7U0SjLbSS0rR+EfkdpJYSkM2Z1orZrUjBbzNQrYOfdJVitXd+ql0= =gSc+ -----END PGP SIGNATURE-----
Received on Monday, 15 June 2015 13:36:24 UTC