| http://www.w3.org/ns/prov#value | - Therefore, backward searching from the goal is the most efficient procedure to determine the route since, in the forward direction, unless some other data such as a flag were generated and stored, complicating the process, the branch from a stored node which corresponded to the solution route could not be determined.) If x is not within L of the goal, at least two further segments of the route are
|
