Re: Against the notion of reification well-formed graph (i.e., atomicity)

On 23 Jan 2024, at 12:22, Peter F. Patel-Schneider <pfpschneider@gmail.com> wrote:

The well-formedness requirement states that an RDF graph is ill-formed if it has a node that is the subject of a triple with any of these predicates and is not the subject of exactly one triple with each of these predicates.  No bijection between triples and anything is either mentioned or implied.  The notion of well-formedness is completely syntactic.

Indeed. This is my point.
This syntactically excludes the well-formedness of the expansion of:
  << :e1 | :s1 :p1 :o1 >> :p :o .
  << :e1 | :s2 :p2 :o2 >> :p :o .
which I argue should be allowed.
—e.