handling unsatisfiable graphs

[pfps]

Semantics says that RDF processors MAY signal an error if they encounter an unsatisfiable graph.

This statement should probably go into Concepts instead.

This has implications with respect to the treatment of ill-typed literals. In 1.1 RDF systems were supposed to handle these and create a graph. Currently Concepts says that systems SHOULD (not MUST) create RDF graphs that contain ill-typed literals, although this change was likely not voted on by the WG.

There should be discussion in Concepts on what happens for inputs that are syntactically legal but unsatisfiable, as are graphs with ill-typed literals.

[afs]

This statement should probably go into Concepts instead.

RDF Concepts does not mention "satisfiable" and "satisfies" is defined in RDF Semantics in simple semantics.

Therefore, I don't see a need to introduce the terminology into RDF Concepts.