Open nichtich opened 4 years ago
The last point "resolvable globally unique and persistent identifiers" eventually requires HTTP URIs. I guess RDF is not a strict requirement for FAIR vocabularies, is it? Given an example identifier we could check automatically if the identifier resolves in any kind of content that includes the same URI in return.
Another question is how to indicate FAIR vocabularies. Is there a logo we can use?
BARTOC should allow to filter for FAIR vocabularies. This requires
Open questions: does a FAIR vocabulary require resolvable URIs or is it possible to have other means of resolving (e.g. lookup in the documentation). Is machine-readable vocabulary content a requirement for a FAIR vocabulary? Without more clear definition of FAIR is its hard to get the information about FAIRness into BARTOC. By now we collect information about;
Is this enough to decide whether a vocabulary is FAIR?