- From: Peter F. Patel-Schneider <pfpschneider@gmail.com>
- Date: Sat, 25 Oct 2014 15:00:37 -0700
- To: Irene Polikoff <irene@topquadrant.com>, 'Holger Knublauch' <holger@topquadrant.com>, public-data-shapes-wg@w3.org
I don't think that the SPIN Modelling document answers my questions. SPIN does more than constraint checking. The details of SPIN as a inferencing system appear to affect its use as a constraint system. For example, what happens if the input graph has spin:CV node? As far as I can tell, spin:CV nodes are no different from other information. Is this the case? I am trying to figure out just how SPIN works, particular as a constraint mechanism, but I'm not finding a complete description, hence my questions. peter On 10/24/2014 08:33 AM, Irene Polikoff wrote: > Peter, > > I believe most of the information you are looking for is available in W3C SPIN submission document, specifically, this part http://www.w3.org/Submission/2011/SUBM-spin-modeling-20110222/ > > In short, SPARQL queries identified using spin:rule predicate are about inferring new triples (thus, these are CONSTRUCT, INSERT and DELETE queries) while those identified using spin:constraint are about checking constraints (ASK and CONSTRUCT queries). > > For example, when ?width and ?height are available, spin:rule may infer the value of ?area. In contrast, if ?width ?height and ?area are all available, a constraint may check if their values are valid - in other words, check if ?area=?width*?height. > > Regards, > > Irene > > > > -----Original Message----- > From: Peter F. Patel-Schneider [mailto:pfpschneider@gmail.com] > Sent: Friday, October 24, 2014 3:42 AM > To: Holger Knublauch; public-data-shapes-wg@w3.org > Subject: Re: Relevant documents on SPIN > > 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 Saturday, 25 October 2014 22:01:09 UTC