]>
SKOS Mapping RDF Vocabulary
This vocabulary allows you to express information about how statements made using concepts from some conceptual scheme may be transformed into statements with concepts from a different scheme. So for example it can be used for automated query transformation. Or It could be used to create a virtual subject index for a collection in terms of an alternative classification system.
Alistair Miles
2004-08-16
mapping-relation
The super-property of all properties expressing information about how to create mappings between concepts frmo different conceptual schemes.
has-exact-match
If two concepts are an 'exact-match' then the set of resources properly indexed against the first concept is identical to the set of resources properly indexed against the second. Therefore the two concepts may be interchanged in queries and subject-based indexes.
has-broad-match
If 'concept A has-broad-match concept B' then the set of resources properly indexed against concept A is a subset of the set of resources properly indexed against concept B.
has-narrow-match
If 'concept A has-narrow-match concept B' then the set of resources properly indexed against concept A is a superset of the set of resources properly indexed against concept B.
has-major-match
If 'concept A has-major-match concept B' then the set of resources properly indexed against concept A shares more than 50% of its members with the set of resources properly indexed against concept B.
has-minor-match
If 'concept A has-minor-match concept B' then the set of resources properly indexed against concept A shares less than 50% but greater than 0 of its members with the set of resources properly indexed against concept B.
AND
This class is a shorthand for an intersection construct. So the statement 'concept A has-exact-match AND (concept B, concept C)' implies that the set of resources properly indexed against concept A is identical to the intersection of the sets properly indexed against concepts B and C.
OR
This class is a shorthand for a union construct. So the statement 'concept A has-exact-match OR (concept B, concept C)' implies that the set of resources properly indexed against concept A is identical to the union of the sets properly indexed against concepts B and C.
NOT
This class is a shorthand for a negation construct. So the statement 'concept A has-exact-match AND (concept B, NOT (concept C))' implies that the set of resources properly indexed against concept A is identical to the intersection of the set properly indexed against concept B and the complement of the set properly indexed against concept C.