| Question asked
|
#In section 4.3.1 authors mention about d …
#In section 4.3.1 authors mention about distributive and collective reading as they choose the former, i.e. the certainty attached with G1 in RDF is considered to be certainty attached with each RDF statement in G1 and the certainty of all facts (n in number) in G1 considered together is certainty*certainty*....n-times. Have I understood it correctly? If not please do not read further! Could we considered certainty attached with G1 in terms of fuzzy logic rather than in probabilistic sense? Further, adopting the same distributive reading we could argue that the certainty of all facts in G1 considered together is minimum of certainty of all the facts, instead of their products?
#There is a possibility that certain meta-property values are available for G1 and not for G2. Have authors discussed this possibility while querying named graphs G1 and G2? If I have missed something, again don't read further! Specifically consider Example 5.9. What happens if Iftime(x1) is known but Iftime(x2) is not known and we are considering Iftime(x1 intersection x2).
#Comment: Idea of replicating meta statements on graphs to individual RDF statements doesn't appear neat! Lots of redundancy, unnecessary load on storage space. ndancy, unnecessary load on storage space.
|
