| http://www.w3.org/ns/prov#value | - In the case of a leaf pointer, third store 114 is accessed (step 212), an alias compare is done (step 214), and if there is a match (the address or key is not an alias), then the associated data fetched from the third memory can be output (step 216).
|
