- From: Thomas Lörtsch <tl@rat.io>
- Date: Wed, 1 Feb 2023 17:27:59 +0100
- To: Doerthe Arndt <doerthe.arndt@tu-dresden.de>
- Cc: "Peter F. Patel-Schneider" <pfpschneider@gmail.com>, "public-rdf-star-wg@w3.org" <public-rdf-star-wg@w3.org>
> > On 1. Feb 2023, at 17:00, Doerthe Arndt <doerthe.arndt@tu-dresden.de> wrote: > > Dear Thomas, > > Of course I remember the discussions and would like to keep this new edition efficient (but of course without ignoring you). It would be more efficient if my concerns were taken a bit more serious. For example I hear about the benefits of referentially opaque triples, but I get no response to my repeated lament that the proposed semantics is all but ignored in practice. I hear mentions of TEP again and again, but I never get a response to my critique that nobody uses that mechanism. So, yes, I think I have good reason to feel ignored. > So, before we get back to the more contraversial discussion about referential opacity: What is your take on the blank nodes? It is questionable that this piecemeal approach will lead to a compelling design overall, but I’ll do my best to answer your question. > I guess you would want them to be transparent? Because here I had the idea that there was a consensus and I would like to start with the few agreements we had. I think referentially transparent blank nodes in referentially opaque embedded triples are beside the point. They seem to require a lot of effort from the semantics, but they achieve very little, as the other statements containing said blank node are not captured. Thus the meaning of the blank node is not fully captured. Then why spend so much energy on syntactic fidelity of the embedded triple in the first place? I think the design stems from the desire to shoehorn N3 formulas into embedded triples and this is one of the issues showing how that approach fails. See [0] for a more complete take on blank nodes, especially how graph literals capturing the full meaning of a blank node as Concise Bound Description could achieve a much higher degree of fidelity and, IMO, practical usefulness. [0] https://lists.w3.org/Archives/Public/public-rdf-star-wg/2023Feb/0002.html
Received on Wednesday, 1 February 2023 16:28:18 UTC