-
Notifications
You must be signed in to change notification settings - Fork 5
Fixes correctness of Appendix A (from issue #139) #160
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Conversation
This was discussed during the #rdf-star meeting on 02 October 2025. View the transcriptPull Request 160 Fixes correctness of Appendix A (from issue #139) (by franconi) [ms:CR]enrico: this is similar to 139 that was discussed before pfps: I'm worried that some members of the WG are asking for fundamental changes to the semantics pchampin: the issue was closed, so what is still coming back? <niklasl> It's w3c/rdf-concepts#220 <gb> CLOSED Pull Request 220 Annotations on asserted triples are based on operational semantics (by rat10) [ms:CR] pfps: this is saying that there is something lacking in Semantics, but are we done now with it, or should we still do something about it ktk: we said in previous meeting that the discussion should be closed lisp: I made a respond but I did not reopened the issue ktk: any other things on Semantics or Concepts? <ktk> https://github.com/orgs/w3c/projects/20/views/11 ktk: there are a number of issues with "propose closing" |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
We have a problem with Grdfs14. The rule cannot be applied to exhaustion. The process will not end.
We need to make that rule dependent on the triples occurring in E.
Which is why I am proposing that IT is partial. Then Grdfs14 is terminating and complete if applied just to existing triple terms in the graph. |
I don't see any problem with having an infinite completion. |
For this appendix it is a problem because it describes a procedure to determine whether a graph S entails a graph E by applying the rules. In this case, the procedure should terminate, but that is not too difficult to get: we could say that we only construct the triple |
It should depend on E, then we can also do that without making IT partial. The more I think about it, the more I am convinced that making IT injective overcomplicates things. But we had that discussion and I accepted it (while I still dislike it). But as mentioned in the other issue: proofs like the one for "Every graph is simply satisfiable." become more complicated while we do not gain anything from the injectivity. It could also be added as a condition when it is actually needed. I would prefer to keep simple entailment simple. |
There are a few problems with Appendix A. In my view they all boil down to the attempt to keep the rules from entailing an infinite number of consequences. But if you do this, then you have to be careful about completeness. The RDF 1.1 Semantics document has a problem with this. The application of rule GrdfD1 has to change to include not just literals in S but also literals in E. Otherwise the empty graph does not entail If the rules are to remain as they are, then Appendix A has to loosen them to include the contents of E in several places. Rules that are impacted: rdfD1, rdfs1, rdfs4. Split rdfs14 into two rules, rdfs14 for the first conclusion and rdfs15 for the second Define RDFS-T entailment pattern from S towards E This leads to:
This is a tiny but sloppy because it should mention E in the fourth step. |
Thank you for the analysis. I did not read RDF Semantics 1.1 carefully enough and was not aware of the fact that the entailment was already problematic there. Your adaption looks good. |
@pfps is fixing this PR according to his comment above. |
I have a PR against your repository. I think you need to merge that. |
I don't see any PR in my repo https://github.com/franconi/rdf-semantics-fork-enrico/pulls |
fix problems in entailment closure
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
OK with the change
In practice there is little utility in re-deriving these | ||
and a subset of the rules can be used to establish most entailments of practical interest.</p> | ||
|
||
<p>If it is important to stay within legal RDF syntax, rule <a>rdfD1</a> may be used instead of <a>GrdfD1</a>, |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
<p>If it is important to stay within legal RDF syntax, rule <a>rdfD1</a> may be used instead of <a>GrdfD1</a>, | |
<p>If it is important to stay within legal RDF syntax, rule <a>rdfD1</a> may be used instead of <a>GrdfD1</a> and <a>rdfs14</a> instead of <a>Grdfs14</a>, |
Closes #139
Preview | Diff