| http://www.w3.org/ns/prov#value | - If no path from the shortest string(s) to the longest string L exists such that L ends up as a formula, then L is not a formula (there also exist algorithms, at least in Polish and reverse Polish notation, to check if a string is or is not a formula).
|
