W3C home > Mailing lists > Public > public-rdf-shapes@w3.org > February 2017

Re: behaviour of ASK-based validators

From: Holger Knublauch <holger@topquadrant.com>
Date: Fri, 10 Feb 2017 08:23:09 +1000
To: "Peter F. Patel-Schneider" <pfpschneider@gmail.com>, public-rdf-shapes@w3.org
Message-ID: <21b3d29b-a2d8-fb31-3997-586e97e6f384@topquadrant.com>

On 10/02/2017 1:18, Peter F. Patel-Schneider wrote:
> On 02/08/2017 10:50 PM, Holger Knublauch wrote:
>> On 9/02/2017 8:54, Peter F. Patel-Schneider wrote:
>>> This part of the description of the behaviour of ASK-based validators doesn't
>>> make any sense at all.  I have no idea what is supposed to be going on here.
>>> "Let QS be the union of the solutions produced for each value node v in vs
>>> so that the solution variable this is bound to the focus node and value is
>>> bound to v."
>> I don't see what's difficult or ambiguous here. QS is a set of solutions. Each
>> solution is a set of name-value pairs (as defined by SPARQL) and I am
>> enumerating these pairs.
>> If you have a specific suggestion for wording that you would find clearer to
>> understand, then I'd be happy to include that.
>> Holger
> What does produce mean here?
> What is doing the producing?
> What does "so that" mean?

I have reworded that paragraph, please let me know if things remain 
ambiguous from your point of view.

> How is this bound to a focus node in a property shape?

That's consistent with how it works for SELECT queries and node shapes. 
I don't see that issue.

Received on Thursday, 9 February 2017 22:23:43 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 17:02:48 UTC