| http://www.w3.org/ns/prov#value | - The length is a natural number, the question asks to show that given two paths which have the longest possible length (i.e. the length is maximum possible) then they have a common node; however if we only take maximal paths (which are paths which we just cannot extend any further) then it might not be true if the length of these paths is not the maximum from the first part.
|
