- From: Peter F. Patel-Schneider <pfpschneider@gmail.com>
- Date: Fri, 24 Oct 2014 00:42:07 -0700
- To: Holger Knublauch <holger@topquadrant.com>, public-data-shapes-wg@w3.org
Thanks Holger, this document does a decent job of outlining SPIN. However, there are some unexplained things. (Maybe these are explained in other documents but I could not Just what signals a constraint violation? Is it the presence of a node of type spin:ConstraintViolation (a spin:CV node)? If so, how can an RDF graph that contains such nodes be processed? Is it the construction of a spin:CV node? If so, what difference is there between spin:constraint and spin:role? Is it the construction of a spin:CV node by a spin:constraint? If so, how is this signalled? It appears that the computation required for constraint checking in SPIN is potentially unbounded. Is that correct? Where is the description of the SPIN execution engine? Do you have a list of known SPIN implementations? peter PS: Let's try to keep the name calling down to close to zero.
Received on Friday, 24 October 2014 07:42:45 UTC