Open AdamSobieski opened 1 year ago
This could be implemented (currently unsure) using a combination of log:semantics
(to retrieve the KB), log:conclusion
or log:inferences
(to get its deductive closure / inferences), and log:includes
to check whether they adhere to the given constraints. See here for more on these builtins.
With respect to language-integrated semantic templates, we could consider using a named graph parameter,
?kb
, and using something like a proposed@requires
keyword to guard the input arguments. Proposed here is an N3 language keyword,@requires
, for describing guards on input arguments.As envisioned, if the
@requires
subgraph is not contained in the knowledgebase,?kb
, the semantic template returns an empty graph.There could also be a corresponding
@requires ?kb not holds { ... }
syntax.Any thoughts on this proposed N3 keyword? Thank you.
See also: https://github.com/w3c-cg/planning/discussions/27#discussioncomment-4388356