icc.ttl

# The content of this file is automatically extracted from icc.trig.
# Changes should be made in icc.trig.pre.

@prefix icc: <https://w3id.org/fair/icc/terms/> .
@prefix fair: <https://w3id.org/fair/principles/terms/> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix owl: <http://www.w3.org/2002/07/owl#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix pav: <http://purl.org/pav/> .
@prefix prov: <http://www.w3.org/ns/prov#> .
@prefix np: <http://www.nanopub.org/nschema#> .
@prefix npx: <http://purl.org/nanopub/x/> .
@prefix orcid: <https://orcid.org/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .

foaf:member a owl:ObjectProperty .
rdfs:seeAlso a owl:ObjectProperty .

fair:FAIR-Principle-or-SubPrinciple rdfs:label "FAIR Principle or Sub-Principle" .

fair:F1 rdfs:label "F1" .
fair:F2 rdfs:label "F2" .

fair:A1 rdfs:label "A1" .
fair:A1.1 rdfs:label "A1.1" .
fair:A1.2 rdfs:label "A1.2" .


<https://orcid.org/0000-0001-5306-5690> <http://www.w3.org/2000/01/rdf-schema#label>
    "Susanna-Assunta Sansone" .

<https://orcid.org/0000-0001-6441-6716> <http://www.w3.org/2000/01/rdf-schema#label>
    "Natalie Meyers" .

<https://orcid.org/0000-0001-6594-9178> <http://www.w3.org/2000/01/rdf-schema#label>
    "Christopher Brewster" .

<https://orcid.org/0000-0001-6960-357X> <http://www.w3.org/2000/01/rdf-schema#label>
    "Mark D. Wilkinson" .

<https://orcid.org/0000-0001-7030-7030> <http://www.w3.org/2000/01/rdf-schema#label>
    "Ignasi Labastida" .

<https://orcid.org/0000-0001-7542-0286> <http://www.w3.org/2000/01/rdf-schema#label>
    "Egon Willighagen" .

<https://orcid.org/0000-0001-8414-9272> <http://www.w3.org/2000/01/rdf-schema#label>
    "Simon Coles" .

<https://orcid.org/0000-0001-8888-635X> <http://www.w3.org/2000/01/rdf-schema#label>
    "Erik Schultes" .

<https://orcid.org/0000-0001-9773-4008> <http://www.w3.org/2000/01/rdf-schema#label>
    "Andra Waagmeester" .

<https://orcid.org/0000-0001-9853-5668> <http://www.w3.org/2000/01/rdf-schema#label>
    "Philippe Rocca-Serra" .

<https://orcid.org/0000-0002-1164-1351> <http://www.w3.org/2000/01/rdf-schema#label>
    "Luiz Olavo Bonino da Silva Santos" .

<https://orcid.org/0000-0002-1215-167X> <http://www.w3.org/2000/01/rdf-schema#label>
    "Rajaram Kaliyaperumal" .

<https://orcid.org/0000-0002-1267-0234> <http://www.w3.org/2000/01/rdf-schema#label>
    "Tobias Kuhn" .

<https://orcid.org/0000-0002-1704-5980> <http://www.w3.org/2000/01/rdf-schema#label>
    "Ronal Cornet" .

<https://orcid.org/0000-0002-2036-8350> <http://www.w3.org/2000/01/rdf-schema#label>
    "Nick Juty" .

<https://orcid.org/0000-0002-3452-553X> <http://www.w3.org/2000/01/rdf-schema#label>
    "Giancarlo Guizzardi" .

<https://orcid.org/0000-0002-4040-0215> <http://www.w3.org/2000/01/rdf-schema#label>
    "Tobias Weigel" .

<https://orcid.org/0000-0002-4182-7560> <http://www.w3.org/2000/01/rdf-schema#label>
    "Kristina Hettne" .

<https://orcid.org/0000-0002-4451-8042> <http://www.w3.org/2000/01/rdf-schema#label>
    "Christine R. Kirkpatrick" .

<https://orcid.org/0000-0002-5301-3142> <http://www.w3.org/2000/01/rdf-schema#label>
    "Chris T. Evelo" .

<https://orcid.org/0000-0002-7633-1442> <http://www.w3.org/2000/01/rdf-schema#label>
    "Mark Thompson" .

<https://orcid.org/0000-0002-7641-6446> <http://www.w3.org/2000/01/rdf-schema#label>
    "Ricardo de Miranda Azevedo" .

<https://orcid.org/0000-0002-7664-3331> <http://www.w3.org/2000/01/rdf-schema#label>
    "Juliane Schneider" .

<https://orcid.org/0000-0002-8042-4131> <http://www.w3.org/2000/01/rdf-schema#label>
    "Myles Axton" .

<https://orcid.org/0000-0002-8691-772X> <http://www.w3.org/2000/01/rdf-schema#label>
    "Marco Roos" .

<https://orcid.org/0000-0002-9551-6370> <http://www.w3.org/2000/01/rdf-schema#label>
    "Mélanie Courtot" .

<https://orcid.org/0000-0003-0413-2003> <http://www.w3.org/2000/01/rdf-schema#label>
    "Annalisa Montesanti" .

<https://orcid.org/0000-0003-0627-8014> <http://www.w3.org/2000/01/rdf-schema#label>
    "Mirjam van Reisen" .

<https://orcid.org/0000-0003-2195-3997> <http://www.w3.org/2000/01/rdf-schema#label>
    "Barbara Magagna" .

<https://orcid.org/0000-0003-2376-9755> <http://www.w3.org/2000/01/rdf-schema#label>
    "Melanie Imming" .

<https://orcid.org/0000-0003-2687-1982> <http://www.w3.org/2000/01/rdf-schema#label>
    "Peter McQuilton" .

<https://orcid.org/0000-0003-2980-4400> <http://www.w3.org/2000/01/rdf-schema#label>
    "Robert Pergl" .

<https://orcid.org/0000-0003-3357-3027> <http://www.w3.org/2000/01/rdf-schema#label>
    "Martijn Kersloot" .

<https://orcid.org/0000-0003-3538-0106> <http://www.w3.org/2000/01/rdf-schema#label>
    "Peter Wittenburg" .

<https://orcid.org/0000-0003-3934-0072> <http://www.w3.org/2000/01/rdf-schema#label>
    "Barend Mons" .

<https://orcid.org/0000-0003-4014-4394> <http://www.w3.org/2000/01/rdf-schema#label>
    "Ali Hasnain" .

<https://orcid.org/0000-0003-4053-7825> <http://www.w3.org/2000/01/rdf-schema#label>
    "Keith Jeffery" .

<https://orcid.org/0000-0003-4098-0464> <http://www.w3.org/2000/01/rdf-schema#label>
    "George Strawn" .

<https://orcid.org/0000-0003-4818-2360> <http://www.w3.org/2000/01/rdf-schema#label>
    "Annika Jacobsen" .

<https://w3id.org/fair/icc/terms/FAIR-Principles-Explained-Working-Group> a <http://xmlns.com/foaf/0.1/Group>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/FAIR-Principles-Explained-Working-Group>;
  <http://www.w3.org/2000/01/rdf-schema#label> "FAIR Principles Explained Working Group"@en;
  <http://xmlns.com/foaf/0.1/member> <https://orcid.org/0000-0001-5306-5690>, <https://orcid.org/0000-0001-6441-6716>,
    <https://orcid.org/0000-0001-6594-9178>, <https://orcid.org/0000-0001-6960-357X>,
    <https://orcid.org/0000-0001-7030-7030>, <https://orcid.org/0000-0001-7542-0286>,
    <https://orcid.org/0000-0001-8414-9272>, <https://orcid.org/0000-0001-8888-635X>,
    <https://orcid.org/0000-0001-9773-4008>, <https://orcid.org/0000-0001-9853-5668>,
    <https://orcid.org/0000-0002-1164-1351>, <https://orcid.org/0000-0002-1215-167X>,
    <https://orcid.org/0000-0002-1267-0234>, <https://orcid.org/0000-0002-1704-5980>,
    <https://orcid.org/0000-0002-2036-8350>, <https://orcid.org/0000-0002-3452-553X>,
    <https://orcid.org/0000-0002-4040-0215>, <https://orcid.org/0000-0002-4182-7560>,
    <https://orcid.org/0000-0002-4451-8042>, <https://orcid.org/0000-0002-5301-3142>,
    <https://orcid.org/0000-0002-7633-1442>, <https://orcid.org/0000-0002-7641-6446>,
    <https://orcid.org/0000-0002-7664-3331>, <https://orcid.org/0000-0002-8042-4131>,
    <https://orcid.org/0000-0002-8691-772X>, <https://orcid.org/0000-0002-9551-6370>,
    <https://orcid.org/0000-0003-0413-2003>, <https://orcid.org/0000-0003-0627-8014>,
    <https://orcid.org/0000-0003-2195-3997>, <https://orcid.org/0000-0003-2376-9755>,
    <https://orcid.org/0000-0003-2687-1982>, <https://orcid.org/0000-0003-2980-4400>,
    <https://orcid.org/0000-0003-3357-3027>, <https://orcid.org/0000-0003-3538-0106>,
    <https://orcid.org/0000-0003-3934-0072>, <https://orcid.org/0000-0003-4014-4394>,
    <https://orcid.org/0000-0003-4053-7825>, <https://orcid.org/0000-0003-4098-0464>,
    <https://orcid.org/0000-0003-4818-2360> .

<https://w3id.org/fair/icc/terms/FAIR-ICC-Model> a <http://www.w3.org/2002/07/owl#Ontology>;
  <http://purl.org/dc/terms/creator> <https://orcid.org/0000-0001-8888-635X>, <https://orcid.org/0000-0002-1267-0234>,
    <https://orcid.org/0000-0003-4818-2360>;
  <http://purl.org/dc/terms/description> "This is the formal model describing the Implementation Choices and Challenges for the FAIR principles.";
  <http://purl.org/dc/terms/license> <https://creativecommons.org/publicdomain/zero/1.0/>;
  <http://purl.org/dc/terms/title> "FAIR Implementation Choices and Challenges Model";
  <http://purl.org/vocab/vann/preferredNamespacePrefix> "icc";
  <http://purl.org/vocab/vann/preferredNamespaceUri> "https://w3id.org/fair/icc/terms/";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/FAIR-ICC-Model>;
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://w3id.org/fair/principles/terms/FAIR> .

<https://w3id.org/fair/icc/terms/Choice> a <http://www.w3.org/2002/07/owl#Class>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/Choice>;
  <http://www.w3.org/2000/01/rdf-schema#label> "Choice"@en;
  <http://www.w3.org/2004/02/skos/core#definition> "The kind of choice communities have to make (can be expressed as a question)"@en .

<https://w3id.org/fair/icc/terms/Challenge> a <http://www.w3.org/2002/07/owl#Class>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/Challenge>;
  <http://www.w3.org/2000/01/rdf-schema#label> "Challenge"@en;
  <http://www.w3.org/2004/02/skos/core#definition> "The kind of challenge that some communities face if the lack of existing resources doesn't allow them to make a choice yet"@en .

<https://w3id.org/fair/icc/terms/Declaration> a <http://www.w3.org/2002/07/owl#Class>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/Declaration>;
  <http://www.w3.org/2000/01/rdf-schema#label> "Declaration"@en;
  <http://www.w3.org/2004/02/skos/core#definition> "Something that is either a ChoiceDeclaration or a ChallengeDeclaration"@en .

<https://w3id.org/fair/icc/terms/ChoiceDeclaration> <http://www.w3.org/2000/01/rdf-schema#isDefinedBy>
    <https://w3id.org/fair/icc/latest/ChoiceDeclaration>;
  <http://www.w3.org/2000/01/rdf-schema#label> "Choice Declaration"@en;
  <http://www.w3.org/2000/01/rdf-schema#subClassOf> <https://w3id.org/fair/icc/terms/Declaration>;
  <http://www.w3.org/2004/02/skos/core#definition> "The expression of a community of their choice made (corresponds to an answer to a question)"@en .

<https://w3id.org/fair/icc/terms/ChallengeDeclaration> <http://www.w3.org/2000/01/rdf-schema#isDefinedBy>
    <https://w3id.org/fair/icc/latest/ChallengeDeclaration>;
  <http://www.w3.org/2000/01/rdf-schema#label> "Challenge Declaration"@en;
  <http://www.w3.org/2000/01/rdf-schema#subClassOf> <https://w3id.org/fair/icc/terms/Declaration>;
  <http://www.w3.org/2004/02/skos/core#definition> "The expression of a community of a challenge they accepted"@en .

<https://w3id.org/fair/icc/terms/Community> a <http://www.w3.org/2002/07/owl#Class>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/Community>;
  <http://www.w3.org/2000/01/rdf-schema#label> "Community"@en;
  <http://www.w3.org/2004/02/skos/core#definition> "A non-empty set of people and/or organizations that form a self-declared community with the aim to implement the FAIR principles for their fields of interest"@en .

<https://w3id.org/fair/icc/terms/Resource> a <http://www.w3.org/2002/07/owl#Class>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/Resource>;
  <http://www.w3.org/2000/01/rdf-schema#label> "Resource"@en;
  <http://www.w3.org/2004/02/skos/core#definition> "An artifact or service that can contribute to the implementation of the FAIR principles"@en .

<https://w3id.org/fair/icc/terms/Explanation> a <http://www.w3.org/2002/07/owl#Class>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#label> "Explanation"@en;
  <http://www.w3.org/2004/02/skos/core#definition> "An explanation of a FAIR (sub)principle"@en .

<https://w3id.org/fair/icc/terms/explains-principle> a <http://www.w3.org/1999/02/22-rdf-syntax-ns#Property>;
  <http://www.w3.org/2000/01/rdf-schema#domain> <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/explains-principle>;
  <http://www.w3.org/2000/01/rdf-schema#label> "explains principle"@en;
  <http://www.w3.org/2000/01/rdf-schema#range> <https://w3id.org/fair/principles/terms/FAIR-Principle-or-SubPrinciple>;
  <http://www.w3.org/2004/02/skos/core#definition> "Links an explanation to the FAIR (sub)principle it explains"@en .

<https://w3id.org/fair/icc/terms/implementation-considerations> a <http://www.w3.org/2002/07/owl#DatatypeProperty>;
  <http://www.w3.org/2000/01/rdf-schema#domain> <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/implementation-considerations>;
  <http://www.w3.org/2000/01/rdf-schema#label> "implementation consideration"@en;
  <http://www.w3.org/2004/02/skos/core#definition> "Explains considerations for communities who are about to implement the given principle."@en .

<https://w3id.org/fair/icc/terms/implementation-examples> a <http://www.w3.org/2002/07/owl#DatatypeProperty>;
  <http://www.w3.org/2000/01/rdf-schema#domain> <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/implementation-examples>;
  <http://www.w3.org/2000/01/rdf-schema#label> "implementation examples"@en;
  <http://www.w3.org/2004/02/skos/core#definition> "Describes examples around the implementation of the given principle."@en .

<https://w3id.org/fair/icc/terms/refers-to-principle> a <http://www.w3.org/1999/02/22-rdf-syntax-ns#Property>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/refers-to-principle>;
  <http://www.w3.org/2000/01/rdf-schema#label> "refers to principle"@en;
  <http://www.w3.org/2000/01/rdf-schema#range> <https://w3id.org/fair/principles/terms/FAIR-Principle-or-SubPrinciple>;
  <http://www.w3.org/2004/02/skos/core#definition> "Connects an entity (for example a choice or challenge) to a FAIR (sub)principle it refers to"@en .

<https://w3id.org/fair/icc/terms/related-challenge> a <http://www.w3.org/1999/02/22-rdf-syntax-ns#Property>;
  <http://www.w3.org/2000/01/rdf-schema#domain> <https://w3id.org/fair/icc/terms/Choice>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/related-challenge>;
  <http://www.w3.org/2000/01/rdf-schema#label> "related challenge"@en;
  <http://www.w3.org/2000/01/rdf-schema#range> <https://w3id.org/fair/icc/terms/Challenge>;
  <http://www.w3.org/2004/02/skos/core#definition> "Connects a Choice to a Challenge that some communities might face before they can make the given kind of choice"@en .

<https://w3id.org/fair/icc/terms/refers-to-choice> a <http://www.w3.org/1999/02/22-rdf-syntax-ns#Property>;
  <http://www.w3.org/2000/01/rdf-schema#domain> <https://w3id.org/fair/icc/terms/ChoiceDeclaration>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/refers-to-choice>;
  <http://www.w3.org/2000/01/rdf-schema#label> "refers to choice"@en;
  <http://www.w3.org/2000/01/rdf-schema#range> <https://w3id.org/fair/icc/terms/Choice>;
  <http://www.w3.org/2004/02/skos/core#definition> "Connects a ChoiceDeclaration to the Choice it is derived from"@en .

<https://w3id.org/fair/icc/terms/refers-to-challenge> a <http://www.w3.org/1999/02/22-rdf-syntax-ns#Property>;
  <http://www.w3.org/2000/01/rdf-schema#domain> <https://w3id.org/fair/icc/terms/ChallengeDeclaration>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/refers-to-challenge>;
  <http://www.w3.org/2000/01/rdf-schema#label> "refers to challenge"@en;
  <http://www.w3.org/2000/01/rdf-schema#range> <https://w3id.org/fair/icc/terms/Challenge>;
  <http://www.w3.org/2004/02/skos/core#definition> "Connects a ChallengeDeclaration to the Challenge it is derived from"@en .

<https://w3id.org/fair/icc/terms/declared-by> a <http://www.w3.org/1999/02/22-rdf-syntax-ns#Property>;
  <http://www.w3.org/2000/01/rdf-schema#domain> <https://w3id.org/fair/icc/terms/Declaration>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/declared-by>;
  <http://www.w3.org/2000/01/rdf-schema#label> "declared by"@en;
  <http://www.w3.org/2000/01/rdf-schema#range> <https://w3id.org/fair/icc/terms/Community>;
  <http://www.w3.org/2004/02/skos/core#definition> "Connects a Declaration to the Community that made the declaration"@en .

<https://w3id.org/fair/icc/terms/chosen-resource> a <http://www.w3.org/1999/02/22-rdf-syntax-ns#Property>;
  <http://www.w3.org/2000/01/rdf-schema#domain> <https://w3id.org/fair/icc/terms/ChoiceDeclaration>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/chosen-resource>;
  <http://www.w3.org/2000/01/rdf-schema#label> "chosen resource"@en;
  <http://www.w3.org/2000/01/rdf-schema#range> <https://w3id.org/fair/icc/terms/Resource>;
  <http://www.w3.org/2004/02/skos/core#definition> "Connects ChoiceDeclaration to the Resource that was chosen through the declaration"@en .

<https://w3id.org/fair/icc/terms/had-challenge> a <http://www.w3.org/1999/02/22-rdf-syntax-ns#Property>;
  <http://www.w3.org/2000/01/rdf-schema#domain> <https://w3id.org/fair/icc/terms/ChoiceDeclaration>;
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/had-challenge>;
  <http://www.w3.org/2000/01/rdf-schema#label> "has open challenge"@en;
  <http://www.w3.org/2000/01/rdf-schema#range> <https://w3id.org/fair/icc/terms/ChallengeDeclaration>;
  <http://www.w3.org/2004/02/skos/core#definition> "Connects a ChoiceDeclaration to a ChallengeDeclaration that describes a challenge that had to be met before the choice could be made"@en .

<http://dbpedia.org/resource/Digital_object_identifier> <http://www.w3.org/2000/01/rdf-schema#label>
    "Digital object identifier" .

<https://doi.org/10.1371/journal.pbio.2001414> <http://www.w3.org/2000/01/rdf-schema#label>
    "McMurry et al. 2017" .

<https://doi.org/10.5281/zenodo.3267434> <http://www.w3.org/2000/01/rdf-schema#label>
    "Juty et al. 2019" .

<https://w3id.org/fair/icc/terms/F1-Explanation> a <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "Principle F1 states that digital resources, i.e. data and metadata, must be assigned a globally unique and persistent identifier in order to be found and resolved by computers. This is the most fundamental of the FAIR principles, as globally unique and persistent identifiers are essential elements found in all of the other FAIR principles. Globally unique means that the identifier is guaranteed to unambiguously refer to exactly one resource in the world. Therefore, it is insufficient for it to be unique only locally (e.g. unique within a single, local database). Persistence refers to the requirement that this globally unique identifier is never reused in another context, and continues to identify the same resource, even if that resource no longer exists, or moves. In practice, this often involves using a third-party to generate an identifier that has guaranteed longevity and is project/organization-independent.";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/F1-Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#label> "Explanation of FAIR principle F1";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <http://dbpedia.org/resource/Digital_object_identifier>,
    <https://doi.org/10.1371/journal.pbio.2001414>, <https://doi.org/10.5281/zenodo.3267434>;
  <https://w3id.org/fair/icc/terms/explains-principle> <https://w3id.org/fair/principles/terms/F1>;
  <https://w3id.org/fair/icc/terms/implementation-considerations> "Current challenges relate to ensuring the longevity of identifiers - in particular, that identifiers created by a project/community should survive the termination of the project or the dissolution of the community. Obtaining a persistent identifier, therefore, may require reliance on a third-party organization that promises longevity, and maintains these identifiers independently of the project/community. Current choices are for each community to choose, for all appropriate digital resources (i.e. data and metadata), identifier registration service(s) such as these that ensure global uniqueness and that also comply with the community-defined criteria for identifier persistence and resolvability.";
  <https://w3id.org/fair/icc/terms/implementation-examples> "A common example of a useful identifier is the Digital Object Identifier (DOI) which is guaranteed by the DOI specification to be globally unique and persistent. DOIs provide an additional service, under principle A1, of being able to direct calls to the source data to the location of that data, even if the identified data moves. This ensures that identifiers are stable and valid beyond the project that generated them. In some circumstances, again with DOIs being an example, third-party persistent identifiers may also provide support for principle A2 (that metadata exists beyond the lifespan of the data) since these identifiers may still be responsive to Web calls, and be capable of providing metadata, even if the source resource is no longer active. For a discussion on identifiers see doi:10.1371/journal.pbio.2001414 and doi:10.5281/zenodo.3267434 ." .

<https://w3id.org/fair/principles/terms/F1> <http://www.w3.org/2000/01/rdf-schema#label>
    "F1" .

<http://dbpedia.org/resource/Data_Documentation_Initiative> <http://www.w3.org/2000/01/rdf-schema#label>
    "Data Documentation Initiative" .

<https://doi.org/10.1038/s41587-019-0080-8> <http://www.w3.org/2000/01/rdf-schema#label>
    "Sansone et al. 2019" .

<https://doi.org/10.25504/FAIRsharing.1t5ws6> <http://www.w3.org/2000/01/rdf-schema#label>
    "Data Documentation Initiative on FAIRsharing" .

<https://doi.org/10.5281/zenodo.3267434> <http://www.w3.org/2000/01/rdf-schema#label>
    "Juty et al. 2019" .

<https://fairsharing.org/FAIRsharing.s248mf> <http://www.w3.org/2000/01/rdf-schema#label>
    "W3C HCLS Dataset Description on FAIRsharing" .

<https://fairsharing.org/standards/> <http://www.w3.org/2000/01/rdf-schema#label>
    "FAIRsharing" .

<https://w3id.org/fair/icc/terms/F2-Explanation> a <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "Whereas principle F1 enables unambiguous identification of resources of interest, principle F2 speaks to the ability to discover a resource of interest through, for example, search or filtering. Digital resources must be described with rich metadata - descriptors of the content of the resource referred to by that identifier. It is hard to generally define the minimally required 'richness' of this metadata, except that the more generous it is, both for humans and computers, the more specifically findable it becomes in refined searches. While other principles speak to the specific kinds of metadata that should be included, principle F2 simply says that a digital resource that is not well-described cannot be accurately discovered. Thus, this principle encourages data providers to consider the various facets of search that might be employed by a user of their data, and to support those users in their discovery of the resource. To enable both global and local search engines to locate a resource, generic and domain-specific descriptors should be provided.";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/F2-Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#label> "Explanation of FAIR principle F2";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <http://dbpedia.org/resource/Data_Documentation_Initiative>,
    <https://doi.org/10.1038/s41587-019-0080-8>, <https://doi.org/10.25504/FAIRsharing.1t5ws6>,
    <https://doi.org/10.5281/zenodo.3267434>, <https://fairsharing.org/FAIRsharing.s248mf>,
    <https://fairsharing.org/standards/>;
  <https://w3id.org/fair/icc/terms/explains-principle> <https://w3id.org/fair/principles/terms/F2>;
  <https://w3id.org/fair/icc/terms/implementation-considerations> "It is a challenge for each domain-specific community to define their own metadata descriptors necessary for optimizing findability. The minimal ‘richness’ of the metadata should be defined so that it serves its intended purpose and should also be guided by the requirements of the other FAIR principles. This then poses a challenge to each community to create machine-actionable templates that facilitate capturing uniform and harmonized metadata about similar data resources among all community stakeholders, and to provide a means to ensure that this metadata is updated and curated (doi:10.5281/zenodo.3267434).";
  <https://w3id.org/fair/icc/terms/implementation-examples> "Examples of metadata schemata can be found in FAIRsharing (https://fairsharing.org/standards/, doi:10.1038/s41587-019-0080-8, [McQuilton et al. Data Intell. DI-2019-0028, 2019]) and include for instance the Data Documentation Initiative (DDI) (https://doi.org/10.25504/FAIRsharing.1t5ws6), the HCLS Dataset Descriptors (https://fairsharing.org/FAIRsharing.s248mf), and many domain-specific “minimal information” models that have been invented." .

<https://w3id.org/fair/principles/terms/F2> <http://www.w3.org/2000/01/rdf-schema#label>
    "F2" .

<https://doi.org/10.1162/dint_a_00031> <http://www.w3.org/2000/01/rdf-schema#label>
    "Thompson et al. 2019" .

<https://w3id.org/fair/icc/terms/F3-Explanation> a <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "Principle F3 states that any description of a digital resource must contain the identifier of that resource being described. For instance, the description of a computational workflow, should explicitly contain the identifier for that workflow in a manner that is unambiguous. This is especially important where the resource and its metadata are stored independently, but persistently linked, which is generally considered good practice in FAIR. The purpose of this principle is twofold. First, it is perhaps trivial to say that a descriptor should explicitly say what object it is describing; however, there is a second, less-obvious reason for this principle. Many digital objects (such as workflows, as mentioned above) have well-defined structures that may disallow the addition of new fields, including fields that could point to the metadata about that digital object. Therefore, if you have one of these digital objects in-hand, the only way to discover its metadata is through a search using the identifier of that digital object. Thus, by requiring that a metadata descriptor contains the identifier of the thing being described, that identifier may then successfully be used as the search term to discover its metadata record.";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/F3-Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#label> "Explanation of FAIR principle F3";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://doi.org/10.1162/dint_a_00031>,
    <https://www.w3.org/TR/vocab-dcat/>;
  <https://w3id.org/fair/icc/terms/explains-principle> <https://w3id.org/fair/principles/terms/F3>;
  <https://w3id.org/fair/icc/terms/implementation-considerations> "It is a challenge to each community to choose a machine-actionable metadata model that explicitly links a resource and its metadata.";
  <https://w3id.org/fair/icc/terms/implementation-examples> "An example of a technology that provides this link is FAIR Data Point (doi:10.1162/dint_a_00031), which is based on the Data Catalogue model (DCAT, https://www.w3.org/TR/vocab-dcat/) that provides not only unique identifiers for potentially multiple layers of metadata, but also provides a single, predictable, and searchable path through these layers of descriptors, down to the data object itself." .

<https://w3id.org/fair/principles/terms/F3> <http://www.w3.org/2000/01/rdf-schema#label>
    "F3" .

<https://www.w3.org/TR/vocab-dcat/> <http://www.w3.org/2000/01/rdf-schema#label> "Data Catalogue model (DCAT)" .

<https://doi.org/10.1162/dint_a_00026> <http://www.w3.org/2000/01/rdf-schema#label>
    "Weigel et al. 2019" .

<https://toolbox.google.com/datasetsearch> <http://www.w3.org/2000/01/rdf-schema#label>
    "Google Dataset Search" .

<https://w3id.org/fair/icc/terms/F4-Explanation> a <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "Principle F4 states that digital resources must be registered or indexed in a searchable resource. The searchable resource provides the infrastructure by which a metadata record (F1) can be discovered, using either the attributes in that metadata (F2) or the identifier of the data object itself (F3) (doi:10.1162/dint_a_00026).";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/F4-Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#label> "Explanation of FAIR principle F4";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://doi.org/10.1162/dint_a_00026>,
    <https://toolbox.google.com/datasetsearch>;
  <https://w3id.org/fair/icc/terms/explains-principle> <https://w3id.org/fair/principles/terms/F4>;
  <https://w3id.org/fair/icc/terms/implementation-considerations> "Current challenges are numerous, significantly limiting, and largely outside of the control of the average data provider. First, there is no single-source for search that currently indexes all possible metadata fields in all domains. Second, there is no uniform way to execute a search, and thus every search tool must be accessed with tool-specific software. Finally, many search engines forbid automated searches, precluding their use by FAIR-enabled software. Various initiatives are emerging that attempt to address this, at least in part, by providing a well-defined, machine-accessible search interface over indexed metadata. Nevertheless, to our knowledge, none of these currently index all possible metadata properties, nor do they span all possible domains/communities; rather, they focus on specific metadata schemas such as schema.org, at the expense of other well-established metadata formats such as DCAT, and/or are limited to specific communities such as biotechnology, astronomy, law, or government/administration. Current choices are for each community to choose, and publicly declare, what search engine to use for their own purposes, general or field-specific, and should at a minimum provide metadata following the standard that is indexed by the search engine of choice. They should also provide a machine-readable interface definition that would allow an automated search without human intervention.";
  <https://w3id.org/fair/icc/terms/implementation-examples> "An example of a generic searchable resource that supports manual exploration is Google Dataset Search (https://toolbox.google.com/datasetsearch); however, this suffers from several of the problems mentioned above, in particular, that it indexes only certain types of metadata (schema.org) and the search cannot be automated under the Google Terms of Service, and therefore cannot be implemented within FAIR software." .

<https://w3id.org/fair/principles/terms/F4> <http://www.w3.org/2000/01/rdf-schema#label>
    "F4" .

<http://dbpedia.org/resource/Hypertext_Transfer_Protocol> <http://www.w3.org/2000/01/rdf-schema#label>
    "Hypertext Transfer Protocol" .

<https://dash.harvard.edu/handle/1/4322580> <http://www.w3.org/2000/01/rdf-schema#label>
    "Suber 2008" .

<https://w3id.org/fair/icc/terms/A1.1-Explanation> a <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "The protocol (mechanism) by which a digital resource is accessed (e.g. queried) should not pose any bottleneck. It describes an access process, hence does not directly pertain to restrictions that apply to using the resource. The protocols underlying the World-Wide Web, such as HTTP, are an archetype for an open, free, and universally implementable protocol. Such protocols reduce the cost of gaining access to digital resources, because they are well defined and open and allow any individual to create their own standards-compliant implementation. That the use of the protocols is free ensures that those lacking monetary means can equitably access the resource. That it is universally implementable ensures that the technology is available to all (and not restricted, for instance, by country or a sub-community), thus encompassing both the \"gratis\" and \"libre\" meaning of \"free\" (https://dash.harvard.edu/handle/1/4322580).";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/A1.1-Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#label> "A1.1 Explanation";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <http://dbpedia.org/resource/Hypertext_Transfer_Protocol>,
    <https://dash.harvard.edu/handle/1/4322580>;
  <https://w3id.org/fair/icc/terms/explains-principle> <https://w3id.org/fair/principles/terms/A1.1>;
  <https://w3id.org/fair/icc/terms/implementation-considerations> "Current challenges are to explicitly and fully document access protocols that are not open/free (for example, access only after personal contact) and make those protocols available as a clearly identified facet of the machine-readable metadata. Current choices are for communities to choose standardized communication protocols that are open, free and universally implementable. ";
  <https://w3id.org/fair/icc/terms/implementation-examples> "The most common example of a compliant protocol is the HTTP protocol that underlies the majority of Web traffic. It has additional useful features, including the ability to request metadata in a preferred format, and/or to inquire as to the formats that are available. It is also widely supported by software and common programming languages." .

<https://w3id.org/fair/principles/terms/A1.1> <http://www.w3.org/2000/01/rdf-schema#label>
    "A1.1" .

<https://doi.org/10.1162/dint_a_00029> <http://www.w3.org/2000/01/rdf-schema#label>
    "Brewster et al. 2019" .

<https://w3id.org/fair/icc/terms/A1.2-Explanation> a <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "This principle clearly demonstrates that FAIR is not equal to ‘open’. Some digital resources, such as data that have access restrictions based on ethical, legal or contractual constraints, require additional measures to be accessed. This often pertains to assuring that the access requester is indeed that requester (authentication), that the requester’s profile and credentials match the access conditions of the resource (authorization), and that the intended use matches permitted use cases (e.g. non-commercial purposes only) (see also R1.1, where there are requirements to provide explicit documentation about who may use the data, and for what purposes). At the level of technical implementation, an additional authentication and authorization procedure must be specified, if it is not already defined by the protocol (see A1.1). A requester can be a human or a machine agent. In the latter case it is probably a proxy for a human or an organization to which the authentication and authorization protocol should be applied, in which case, the machine should be expected to present the appropriate credentials. The principle requires that a FAIR resource must provide such a protocol, but the protocol itself is not further specified. In practice, an Internet of FAIR Data and Services cannot function without implementing Authentication and Authorization Infrastructure (AAI, see also https://doi.org/10.1162/dint_a_00029).";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/A1.2-Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#label> "A1.2 Explanation";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://dash.harvard.edu/handle/1/4322580>,
    <https://doi.org/10.1162/dint_a_00029>;
  <https://w3id.org/fair/icc/terms/explains-principle> <https://w3id.org/fair/principles/terms/A1.2>;
  <https://w3id.org/fair/icc/terms/implementation-considerations> "Current choices are for communities to choose protocols to use when controlling access of agents to meta(data). Preferably these should be as generic as possible and as domain specific as necessary. Attempts to harmonize AAI approaches are numerous, but not covered in this article.";
  <https://w3id.org/fair/icc/terms/implementation-examples> "Again, the most common example of a compliant protocol is the HTTP protocol. Another example is the life science AAI protocol. Brewster et al. (https://doi.org/10.1162/dint_a_00029) describe an early implementation of an ontology-based approach to this challenge." .

<https://w3id.org/fair/principles/terms/A1.2> <http://www.w3.org/2000/01/rdf-schema#label>
    "A1.2" .

<https://w3id.org/fair/icc/terms/A1-Explanation> a <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "A primary purpose of identifying a digital resource is to simultaneously provide the ability to retrieve the record of that digital resource, in some format, using some clearly-defined mechanism: hence the retrievability is a facet of FAIR Accessibility. Here, the emphasis is on 'ability': there should be no additional barrier retrieval of the record by some agent when its access protocol (A1.1) results in permitted access to that record. Note that the agent may be a machine working behind a firewall, if that agent has been permitted access. For fully mechanized access, this requires that the identifier (F1) follows a globally-accepted schema that is tied to a standardized, high-level communication protocol. The 'standardized communication protocol' is critical here. Its purpose is to provide a predictable way for an agent to access a resource, regardless of whether unrestricted access to the content of the resource is granted or not.";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/A1-Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#label> "A1 Explanation";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://w3id.org/fair/icc/terms/A1.1-Explanation>,
    <https://w3id.org/fair/icc/terms/A1.2-Explanation>, <https://www.w3.org/Protocols/>;
  <https://w3id.org/fair/icc/terms/explains-principle> <https://w3id.org/fair/principles/terms/A1>;
  <https://w3id.org/fair/icc/terms/implementation-examples> "An example of a standardized access protocol is the Hypertext Transfer Protocol (HTTP1); however, FAIR does not preclude non-mechanized access protocols, such as a verbal request to the data holder in the case of highly sensitive data, so long as the access protocol is explicit and clearly defined. Conditions of compliance are further specified in sub-principles A1.1 and A1.2." .

<https://w3id.org/fair/principles/terms/A1> <http://www.w3.org/2000/01/rdf-schema#label>
    "A1" .

<https://www.w3.org/Protocols/> <http://www.w3.org/2000/01/rdf-schema#label> "HTTP - Hypertext Transfer Protocol" .

<http://www.dcc.ac.uk/> <http://www.w3.org/2000/01/rdf-schema#label> "Digital Curation Centre" .

<http://www.dcc.ac.uk/resources/data-management-plans> <http://www.w3.org/2000/01/rdf-schema#label>
    "Data Management Plan" .

<https://doi.org/10.1162/dint_a_00043> <http://www.w3.org/2000/01/rdf-schema#label>
    "Jones et al. 2019" .

<https://doi.org/10.25490/a97f-egyk> <http://www.w3.org/2000/01/rdf-schema#label>
    "Martone et al. 2014" .

<https://w3id.org/fair/icc/terms/A2-Explanation> a <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "There is a continued focus on keeping relevant digital resources available in the future. Data may no longer be accessible either by design (e.g. a defined life-span within limited financial resources or legal requirements to destroy sensitive data) or by accident. However, given that those data may have been used and are referenced by others, it is important that consumers have, at the very least, access to high quality metadata that describes those resources sufficiently to minimally understand their nature and their provenance, even when the relevant data are not available anymore. This principle relies heavily on the ‘second purpose’ of principle F3 (the metadata record contains the identifier of the data), because in the case where the data record is no longer available, there must be a clear and precise way of discovering its historical metadata record. This aspect of accessibility is further elaborated in the Joint Declaration of Data Citation Principles (doi:10.25490/a97f-egyk).";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/A2-Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#label> "A2 Explanation";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <http://www.dcc.ac.uk/>, <http://www.dcc.ac.uk/resources/data-management-plans>,
    <https://doi.org/10.1162/dint_a_00043>, <https://doi.org/10.25490/a97f-egyk>;
  <https://w3id.org/fair/icc/terms/explains-principle> <https://w3id.org/fair/principles/terms/A2>;
  <https://w3id.org/fair/icc/terms/implementation-considerations> "Current choices/challenges are for communities to choose/define a persistence policy for metadata that describes data that may not always be available, choose/define machine-actionable templates for a persistence policy document for metadata, and in addition choose/define a machine-actionable scheme to reference the metadata persistence policy.";
  <https://w3id.org/fair/icc/terms/implementation-examples> "Examples of early attempts to address this critical principle relates closely to the principles of digital curation (http://www.dcc.ac.uk/) including the concept of a FAIR compliant DMP (Data Management Plan; http://www.dcc.ac.uk/resources/data-management-plans) (doi:10.1162/dint_a_00043). Many other efforts are underway to improve the long-term stewardship of reusable digital resources." .

<https://w3id.org/fair/principles/terms/A2> <http://www.w3.org/2000/01/rdf-schema#label>
    "A2" .

<https://doi.org/10.1162/dint_a_00040> <http://www.w3.org/2000/01/rdf-schema#label>
    "Guizzardi 2019" .

<https://w3id.org/fair/icc/terms/I1-Explanation> a <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "Consumers spend a disproportionate amount of time trying to make sense of the digital resources they need and designing accurate ways to combine them. This is most often due to a lack of suitably unambiguous content descriptors, or a lack of such descriptors entirely with respect to non-machine-interpretable data formats such as tables or “generic” XML. Community-defined data exchange formats work reasonably well within their original scope of a few types of data and a relatively homogeneous community, but not well beyond that. This makes interoperation and integration an expensive, often impossible task (even for humans), but also means that machines cannot easily make use of digital resources, which is the primary goal of FAIR. For example, when a machine visits two data files in which a field “temperature” is present, then it will need more contextual descriptions to distinguish between weather data in one file and body temperature measurements in another. Achieving a ‘common understanding’ of digital resources through a globally understood ‘language’ for machines is the purpose of principle I1, with emphasis on ‘knowledge’ and ‘knowledge representation’. This becomes critical when many differently formatted resources need to be visited or combined across organizations and countries and is especially challenging for interdisciplinary studies or for meta-analyses, where results from independent organizations, pertaining to the same topic, must be combined.  In this context, the principle says that producers of digital resources are required to use a language (i.e., a representation of data/knowledge) that has a defined mechanism for mechanized interpretation - a machine-readable “grammar” - where, for example, the difference between an entity, as well as any relevant relationship between entities, is defined in the structure of the language itself. This allows machines to consume the information with at least a basic “understanding” of its content. It is a step towards a common understanding of digital resources by machines, which is a prerequisite for a functional Internet of FAIR Data and Services. Several technologies can be chosen for principle I1.";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/I1-Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#label> "I1 Explanation";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://doi.org/10.1162/dint_a_00040>,
    <https://www.w3.org/RDF/>;
  <https://w3id.org/fair/icc/terms/explains-principle> <https://w3id.org/fair/principles/terms/I1>;
  <https://w3id.org/fair/icc/terms/implementation-considerations> "Communities will have to choose an available technology or decide how they will otherwise deal with multiple representations and languages. In any case, they will have to make sure that each data item that is the same in multiple resources is interpreted in exactly the same way by every agent (human and computer), and that how items across resources relate to one another can be unambiguously understood by all agents (doi:10.1162/dint_a_00040). The key consideration in this regard is that FAIR speaks to the ability of data to be reused by a generic agent, rather than a community-specific agent. This is most easily accomplished by making the knowledge available in the most widely used format(s), even if this means duplication of the information in the community-specific format.";
  <https://w3id.org/fair/icc/terms/implementation-examples> "The most widely-accepted choice to adhere to this principle, at the present time, is the Resource Description Framework (RDF) which is the W3C’s recommendation for how to represent knowledge on the Web in a machine-accessible format (https://www.w3.org/RDF/). Other choices may also be acceptable, for instance when they are already in widespread use within a given community. In that case, it would be helpful for the community to also provide a “translator” between their preferred format, and a more widely used format such as RDF." .

<https://w3id.org/fair/principles/terms/I1> <http://www.w3.org/2000/01/rdf-schema#label>
    "I1" .

<https://www.w3.org/RDF/> <http://www.w3.org/2000/01/rdf-schema#label> "Resource Description Framework (RDF)" .

<http://dbpedia.org/resource/Web_Ontology_Language> <http://www.w3.org/2000/01/rdf-schema#label>
    "Web Ontology Language (OWL)" .

<https://bioportal.bioontology.org/> <http://www.w3.org/2000/01/rdf-schema#label>
    "BioPortal" .

<https://w3id.org/fair/icc/terms/I2-Explanation> a <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "Principle I2 uses 'vocabularies' to refer to the methods that unambiguously represent concepts that exist in a given domain. The use of shared, and formally structured (I1), sets of terms is an essential part of FAIR. Terminology systems, including flat ‘vocabularies’, hierarchical ‘thesauri’ and more granular specifications of knowledge such as data models and ontologies, play an important role in community standards. However, the vocabularies used for metadata or data also need to be findable, accessible, interoperable, and reusable in their own right so that users (including machines) can fully understand the meaning of the terms used in the metadata. This principle has been criticized as ‘circular’ but as has been made clear earlier in this article, the simple use of a “label” (e.g. “temperature”) is insufficient to enable a machine to understand both the intent of that label (Body temperature? Melting temperature?) and the contexts within which it can be properly linked - same-with-same - to other similarly-labelled data. I2, therefore, requires that the vocabulary terms used in the knowledge representation language (principle I1) can be sufficiently distinguished, by a machine, to ensure detection of ‘false agreements’ as well as ‘false disagreements’.";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/I2-Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#label> "I2 Explanation";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <http://dbpedia.org/resource/Web_Ontology_Language>,
    <https://bioportal.bioontology.org/>;
  <https://w3id.org/fair/icc/terms/explains-principle> <https://w3id.org/fair/principles/terms/I2>;
  <https://w3id.org/fair/icc/terms/implementation-considerations> "Current considerations are for communities to ensure that terminology systems and, for instance, the units of measure, classifications, and relationship definitions are themselves FAIR. Thesauri that are proprietary and not universally accessible should be avoided wherever possible, because machines (and indeed particular countries, regions or communities as a whole) may not have the authority to access their definitions, such that even data that is accessible after authentication via A1.2 may not be useful to an agent that has no authority to access the concept definitions used within that data.";
  <https://w3id.org/fair/icc/terms/implementation-examples> "Ontologies defined in the ‘Web Ontology Language’ (OWL) and shared via a publicly accessible registry (e.g. BioPortal for life science ontologies; https://bioportal.bioontology.org/) are examples of formally represented, accessible, mapped, and shared knowledge representations in a broadly applicable language for knowledge representation, that are also compliant with the Findability requirements of FAIR, since BioPortal provides a machine-accessible search interface." .

<https://w3id.org/fair/principles/terms/I2> <http://www.w3.org/2000/01/rdf-schema#label>
    "I2" .

<http://wikidata.org/> <http://www.w3.org/2000/01/rdf-schema#label> "WikiData" .

<https://bioportal.bioontology.org/ontologies/SIO> <http://www.w3.org/2000/01/rdf-schema#label>
    "SemanticScience Integrated Ontology" .

<https://doi.org/10.1145/2187980.2188242> <http://www.w3.org/2000/01/rdf-schema#label>
    "Vrandečić 2012" .

<https://w3id.org/fair/icc/terms/I3-Explanation> a <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "An important aspect of FAIR is that data or metadata, generally speaking, does not exist in a silo - we must do what is necessary to ensure that the knowledge representing a resource is connected to that of other resources to create a meaningfully interlinked network of data and services. A “qualified reference” is a reference to another resource (i.e., referencing that external resource’s persistent identifier), in which the nature of the relationship is also clearly specified. For instance, when multiple versions of a metadata file are available, it may be useful to provide links to prior or next versions using a named relation such as “prior version” or “next version” (preferably using an appropriate community standard relationship that itself conforms to the FAIR principles). In the case of data, imagine a dataset that specifies the population of cities around the world. To be FAIR with respect to principle I3, the data could contain links to a resource containing city data (e.g. Wikidata: http://wikidata.org/, doi:10.1145/2187980.2188242), geographical and geospatial data, or other related domain resources that are generated by that city, so long as they are properly qualified references using meaningful, clearly-interpretable relationships. It is also important to note that many different metadata files (containers) being FAIR digital resources in themselves, can be pointing to the same ‘target’ object (a data set or a workflow for instance). We can for instance have intrinsic metadata (‘what is this’) and how was it created (provenance type metadata) as well as ‘secondary’ metadata that are for instance created (separately and later in time) by reusers of a particular digital resource. These could all be metadata containers essentially describing the same digital resource from different perspectives. This principle therefore also relates to the good practice to clearly distinguish between metadata (files/containers) and the resources they describe.";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/I3-Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#label> "I3 Explanation";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <http://wikidata.org/>, <https://bioportal.bioontology.org/ontologies/SIO>,
    <https://doi.org/10.1145/2187980.2188242>;
  <https://w3id.org/fair/icc/terms/explains-principle> <https://w3id.org/fair/principles/terms/I3>;
  <https://w3id.org/fair/icc/terms/implementation-considerations> "The considerations and choices made here are based on the same reasoning as the decisions made for principle I2. Vocabularies (often formal ontologies) of both concepts and relationships exist, and an appropriate relationship should either be selected from one of these, or “coined” and properly published following the FAIR Principles.";
  <https://w3id.org/fair/icc/terms/implementation-examples> "It is worth noting as an example that several “upper ontologies” such as the SemanticScience Integrated Ontology (https://bioportal.bioontology.org/ontologies/SIO) have a wide range of precisely-defined relationships that can be used as-is, or as a starting-point for a newly-minted relationship that is more specific than the one provided in the upper-ontology. The benefit of “inheriting” from higher-level relationships is that agents capable of understanding these higher level concepts, can infer at least a basic interpretation of the intent of the new relationship coined within the community, and therefore enhances interoperability." .

<https://w3id.org/fair/principles/terms/I3> <http://www.w3.org/2000/01/rdf-schema#label>
    "I3" .

<http://sulab.org/2016/08/open-data-should-mean-cc0/> <http://www.w3.org/2000/01/rdf-schema#label>
    "Open Data should mean CC0, not CC-BY" .

<https://creativecommons.org/share-your-work/public-domain/cc0/> <http://www.w3.org/2000/01/rdf-schema#label>
    "CC0" .

<https://w3id.org/fair/icc/terms/R1.1-Explanation> a <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "Digital resources and their metadata must always, without exception, include a license that describes under which conditions the resource can be used, even if that is ‘unconditional’. By default, resources cannot be legally used without this clarity. Note also that a license that cannot be found by an agent, is effectively the same as no license at all. Furthermore, the license may be different for a data resource and the metadata that describes it, which has implications for the indexing of metadata v.v. findability. This is a clear public domain statement, an equivalent such as terms of use or computer protocol to digitally facilitate an operation (for instance a smart contract). Thus, the absence of a license does not indicate “open”, but rather creates legal uncertainty that will deter (in fact, in many cases legally prevent) reuse. Note also that the combination of resources with restrictive license conditions may lead to adverse effects, and ultimately preclude the use of the combined resources. In order to facilitate reuse, the license chosen should be as open as possible.";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/R1.1-Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#label> "R1.1 Explanation";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <http://sulab.org/2016/08/open-data-should-mean-cc0/>,
    <https://creativecommons.org/share-your-work/public-domain/cc0/>;
  <https://w3id.org/fair/icc/terms/explains-principle> <https://w3id.org/fair/principles/terms/R1.1>;
  <https://w3id.org/fair/icc/terms/implementation-considerations> "A current challenge is that there is currently no well-defined relationship(s) that can be used to distinguish a license that applies to the data being described, versus a license that applies to the metadata record itself, resulting in potential ambiguity in the interpretation of a license referred-to in the metadata record. Current choices are for communities to choose which usage license(s) or licensing requirements to reusable digital resources as well as to their metadata for its own purposes, but also consider broader reuse than originally anticipated or intended.";
  <https://w3id.org/fair/icc/terms/implementation-examples> "There are good reasons for choosing a CC0 license for data (http://sulab.org/2016/08/open-data-should-mean-cc0/) and these considerations should be assessed, alongside all other considerations, when a community decides on the license they wish to apply. It is critical, however, that a license is chosen. The community should then ensure that a qualified link to that license is contained in the metadata record." .

<https://w3id.org/fair/principles/terms/R1.1> <http://www.w3.org/2000/01/rdf-schema#label>
    "R1.1" .

<https://doi.org/10.1162/dint_a_00043> <http://www.w3.org/2000/01/rdf-schema#label>
    "Jones et al. 2019" .

<https://ds-wizard.org> <http://www.w3.org/2000/01/rdf-schema#label> "Data Stewardship Wizard" .

<https://more.metadatacenter.org/tools-training/outreach/cedar-template-model> <http://www.w3.org/2000/01/rdf-schema#label>
    "CEDAR" .

<https://provenance.ecs.soton.ac.uk/prov-template/> <http://www.w3.org/2000/01/rdf-schema#label>
    "PROV-Template" .

<https://w3id.org/fair/icc/terms/R1.2-Explanation> a <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "Detailed provenance includes facets such as how the resource was generated, why it was generated, by whom, under what conditions, using what starting-data or source-resource, using what funding/resources, who owns the data, who should be given credit, and any filters or cleansing processes that have been applied post-generation. Provenance information helps people and machines assess whether a resource meets their criteria for their intended reuse, and what data manipulation procedures may be necessary in order to reuse it appropriately.";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/R1.2-Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#label> "R1.2 Explanation";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://doi.org/10.1162/dint_a_00043>,
    <https://ds-wizard.org>, <https://more.metadatacenter.org/tools-training/outreach/cedar-template-model>,
    <https://provenance.ecs.soton.ac.uk/prov-template/>, <https://www.castoredc.com/for-researchers/>;
  <https://w3id.org/fair/icc/terms/explains-principle> <https://w3id.org/fair/principles/terms/R1.2>;
  <https://w3id.org/fair/icc/terms/implementation-considerations> "Current choices are for communities to choose a set of metadata descriptions to optimize provenance to optimally enable machine and human reusability for its own purposes. These choices, and, as argued before the richness of the provenance associated with a digital resource will strongly influence its actual reuse. Therefore, the implementation considerations for implementing according to this principle are inherently the same as described for principle F2, but now more focused on appropriateness for reuse than on findability per se.";
  <https://w3id.org/fair/icc/terms/implementation-examples> "Provenance descriptions can for instance be implemented following community specific templates according to the PROV-Template (https://provenance.ecs.soton.ac.uk/prov-template/) approach. These templates allow to predefine the structure of the intended collection of provenance information using variables which are later instantiated with appropriate data extracted from existing process output. Such templates also reduce the burden on community members to deeply understand the highly structured PROV ontology, and the well-defined data structures that emerge from its use - that is to say, PROV should not be treated as a simple vocabulary from which terms can be selected, but rather as a model that constrains how those terms must be used in relation to one another. Several early tools are under development to make the construction of FAIR metadata easier, including for instance CEDAR (https://more.metadatacenter.org/tools-training/outreach/cedar-template-model), CASTOR (https://www.castoredc.com/for-researchers/) and the knowledge models in the Data Stewardship Wizard (https://ds-wizard.org, doi:10.1162/dint_a_00043)." .

<https://w3id.org/fair/principles/terms/R1.2> <http://www.w3.org/2000/01/rdf-schema#label>
    "R1.2" .

<https://www.castoredc.com/for-researchers/> <http://www.w3.org/2000/01/rdf-schema#label>
    "CASTOR" .

<https://doi.org/10.1038/ng1201-365> <http://www.w3.org/2000/01/rdf-schema#label>
    "Brazma et al. 2001" .

<https://doi.org/10.1038/s41587-019-0080-8> <http://www.w3.org/2000/01/rdf-schema#label>
    "Sansone et al. 2019" .

<https://fairsharing.org/standards/> <http://www.w3.org/2000/01/rdf-schema#label>
    "FAIRsharing" .

<https://w3id.org/fair/icc/terms/R1.3-Explanation> a <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "Where community standards or best practices for data archiving and sharing exist, they should be followed. Several disciplinary communities have defined Minimal Information Standards describing most often the minimal set of metadata items required to assess the quality of the data acquisition and processing and to facilitate reproducibility. Such standards are a good start, noting that true (interdisciplinary) reusability will generally require richer metadata. For a list of such standards, consult FAIRsharing (https://fairsharing.org/standards/, doi:10.1038/s41587-019-0080-8).";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/R1.3-Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#label> "R1.3 Explanation";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://doi.org/10.1038/ng1201-365>,
    <https://doi.org/10.1038/s41587-019-0080-8>, <https://fairsharing.org/standards/>;
  <https://w3id.org/fair/icc/terms/explains-principle> <https://w3id.org/fair/principles/terms/R1.3>;
  <https://w3id.org/fair/icc/terms/implementation-considerations> "Current choices are for a community to choose which practices to use for data and metadata, taking into full consideration the relevant inter-domain interoperability requirements. Communities must then take-on the challenge of deciding which metadata elements, addressed within their community’s “boutique” standard(s), should be additionally represented using a more global standard (principles F2 and R1.2), even if this results in duplication of metadata, such that it can be used for search and interpretation by more generic, third-party agents.";
  <https://w3id.org/fair/icc/terms/implementation-examples> "An example of minimal information standards is the MIAME standard (doi:10.1038/ng1201-365), and various metadata profiles have been defined on top of specifications (e.g. various DCAT profiles)." .

<https://w3id.org/fair/principles/terms/R1.3> <http://www.w3.org/2000/01/rdf-schema#label>
    "R1.3" .

<https://w3id.org/fair/icc/terms/R1-Explanation> a <https://w3id.org/fair/icc/terms/Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "On its surface, principle R1 appears very similar to principle F2. However, the rationale behind principle F2 is to enable effective attribute-based search and query (findability), while the focus of R1 is to enable machines and humans to assess if the discovered resource is appropriate for reuse, given a specific task. For example, not all gene expression data for a given locus are relevant to a study of the effects of heat stress.  While inappropriate data may be discovered by the agent’s initial search (principle F2) for expression data about a given gene, here we address the ability to assess the discovered data based on suitability-for-purpose. This reiterates the need for providers to consider not only high-level metadata facets, that will assist in generic search, but also to consider more detailed metadata that will provide much more ‘operational’ instructions for re-use.  In this setting, a wide variety of factors may be needed to determine whether a resource is suitable for inclusion in an analysis, and how to adequately process it. ";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/R1-Explanation>;
  <http://www.w3.org/2000/01/rdf-schema#label> "R1 Explanation";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://w3id.org/fair/icc/terms/R1.1-Explanation>,
    <https://w3id.org/fair/icc/terms/R1.2-Explanation>, <https://w3id.org/fair/icc/terms/R1.3-Explanation>;
  <https://w3id.org/fair/icc/terms/explains-principle> <https://w3id.org/fair/principles/terms/R1>;
  <https://w3id.org/fair/icc/terms/implementation-examples> "The term “plurality” is used to indicate that the metadata author should be as generous as possible, not presuming who the consumer might be, and therefore provide as much metadata as possible to support the widest variety of use-cases and agent needs. The sub-principles R1.1, R1.2 and R1.3 define some critical types of attributes that contribute to R1." .

<https://w3id.org/fair/principles/terms/R1> <http://www.w3.org/2000/01/rdf-schema#label>
    "R1" .

<https://w3id.org/fair/icc/terms/F1-Choice> a <https://w3id.org/fair/icc/terms/Choice>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "The community should choose identifier registration service(s) that ensure global uniqueness for its digital resources.";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/F1-Choice>;
  <http://www.w3.org/2000/01/rdf-schema#label> "F1 Choice";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://w3id.org/fair/icc/terms/F1-Explanation>;
  <https://w3id.org/fair/icc/terms/refers-to-principle> <https://w3id.org/fair/principles/terms/F1>;
  <https://w3id.org/fair/icc/terms/related-challenge> <https://w3id.org/fair/icc/terms/F1-Challenge-1> .

<https://w3id.org/fair/icc/terms/F1-Challenge-1> a <https://w3id.org/fair/icc/terms/Challenge>;
  <http://www.w3.org/2000/01/rdf-schema#comment> "The community should define identifier registration service(s) that ensure global uniqueness for its digital resources.";
  <http://www.w3.org/2000/01/rdf-schema#isDefinedBy> <https://w3id.org/fair/icc/latest/F1-Challenge-1>;
  <http://www.w3.org/2000/01/rdf-schema#label> "F1 Challenge 1";
  <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://w3id.org/fair/icc/terms/F1-Explanation>;
  <https://w3id.org/fair/icc/terms/refers-to-principle> <https://w3id.org/fair/principles/terms/F1> .