| http://www.w3.org/ns/prov#value | - On 04/27/2012 12:57 PM, David Leverton wrote: > Zac Medico wrote: >> So, here is a description of the whole algorithm that I would use: >> [snip] > > I think the following is equivalent, but simpler and more general since > it does not have to mention details like ** and friends that are not > currently in PMS, and does not assume that the rule for handling KEYWORDS > is simply does it contain at least o
|
