<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Rights declaration in Linked Data</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Ontology Engineering Group, Universidad Polit ́ecnica de Madrid</institution>
          ,
          <country country="ES">Spain</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>V ́ıctor Rodr ́ıguez-Doncel</institution>
          ,
          <addr-line>Asunci ́on G ́omez-P ́erez, and Nandana Mihindukulasooriya</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Linked Data is not always published with a license. Sometimes a wrong license type is used, like a license for software, or it is not expressed in a standard, machine readable manner. Yet, Linked Data resources may be subject to intellectual property and database laws, may contain personal data subject to privacy restrictions or may even contain important trade secrets. The proper declaration of which rights are held, waived or licensed is a must for the lawful use of Linked Data at its different granularity levels, from the simple RDF statement to a dataset or a mapping. After comparing the current practice with the actual needs, six research questions are posed.</p>
      </abstract>
      <kwd-group>
        <kwd>Linked Data</kwd>
        <kwd>licensing</kwd>
        <kwd>intellectual property rights</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        The term Linked Data (LD) is generally defined as a set of best practices for
publishing and connecting structured data on the Web [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], and RDF is the
preferred technology for representing this data. RDF information unit is the triple
(a simple statement with a subject, a property and an object), being a RDF
graph a set of triples, and a RDF dataset a collection of RDF graphs. Triples
provide information about resources (identified by URIs) constituting pieces of
data (or metadata —if the resource is data itself). The resources in a dataset
are often linked to the resources in other datasets, through RDF mappings.
      </p>
      <p>
        Linked Data is accessible to the public through the HTTP protocol, usually
as RDF dumps in files or in SPARQL endpoints. However, being publicly
available doesn’t entitle the public to do any arbitrary action on the LD resources,
and unless otherwise stated intellectual property (IP) rights and database rights
will be in force if they exist. The most common practice with LD, however, is
waiving some of the rights subject to certain conditions, using public notices
called licenses. If these licenses are generous enough, they are called open
licenses, and the Linked Data thus licensed is called Linked Open Data (LOD).
The subset of LD that is not licensed as LOD has been termed Linked Closed
Data (LCD) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], Linking Enterprise Data [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] or simply proprietary data.
⋆ This research is supported by the Spanish Ministry of Science and Innovation through
a Juan de la Cierva postdoctoral fellowship, the LiDER project (FP7-610782) and
the project BabelData (TIN2010-17550).
      </p>
      <p>The lax and vague terms under which LD has been sometimes published has
sufficed for all purposes, as the data publishers have been usually tolerant with
its improper use not prosecuting it in the courts. However, misusing or disclosing
high value data may suppose a real economic harm for those who have invested
time and money in producing the dataset and it may cause legal trouble to the
breaching user if sued. Further, it may discourage businesses entering the LD
markets as they would fear having similar economic damage themselves. For the
lawful use of Linked Data, a proper rights declaration understandable by humans
and machines alike is a precondition. The following use case illustrates this need,
which is not limited to IP-related laws but also to database laws, privacy laws
and even trade secrecy laws.</p>
      <p>Alice, a data engineer, starts working today. She has been given a RDF
dataset with valuable information, with no other indications, and she is
unsure about what she can do. What is the risk of publishing it? Would
she be breaking the IP law or, even worse, disclosing a trade secret? Can
she edit the contents or even change the format of the dataset? What
about distributing or selling the dataset?</p>
      <p>The need for rights declaration is not limited to LCD, as lawfully using LOD
also requires the satisfaction of the conditions in the license, nor is a different
problem for either case, as the interplay of LOD and LCD in hybrid business
models is likely to boost them. This paper describes the legal framework for
publishing and consuming Linked Data which must be known by LD engineers
(Section 2 and Section 3). It also makes an overview of the existing vocabularies
for declaring rights and licenses in RDF (Section 4) to follow with an assessment
of the actual use of these licensing terms (Section 5). Finally, the Section 6
opposes the legal requirements for Linked Data-centric business to appear with
the existing of vocabularies and its actual use.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Legal Framework</title>
      <p>
        Linked Data can become a high-value asset worthy to be protected. This
protection can be achieved by means of secrecy –disclosing the data only to selected
parties who have possibly paid, for example, as suggested in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. But law also
offers a certain protection for data producers. Following the example before,
Alice perhaps had received any of the datasets exemplified in Figure 1. The first
contains literary works, the second a trade secret, the third personal data and
the fourth mere data not subject to IP rights. Each case is different, existing
rights associated to different parties (works‘ creator, the company holding the
secret, the persons whose data is in a file), and all of the databases possibly
subject to database rights. This section examines the different cases.
      </p>
      <p>First, if data is not generally known to the public, if data confers some kind
of economic benefit on its holder (and specifically by the fact that it is not
generally known) and if it is subject of reasonable efforts, then it is object of
protection by trade secrecy laws (in some jurisdictions named as confidential
CocaCola
Formula
22ºC
760mm
17ºC
-5ºC
information laws). Trade secrecy was included in the TRIPS agreements1, and
disclosing a trade secret is a prosecuted action everywhere, whose punishment
is even harsher if the secret is of a military nature –if we are to have Military
Linked Data. Disclosing a secret is an act which may be punishable under the
criminal law. Other laws may preclude the communication of datasets if they
express defamations, libels or other forbidden contents. This may have little
interest for the data engineer, who yet should know that some datasets may not
be spread out of a certain circle or even not communicated at all.</p>
      <p>Second, data may be qualified to become object of protection by the
intellectual property laws. Data, as a representation of a fact or an idea, is not
necessarily the expression of an intellectual endeavour and in principle it does
not get protection per se. But data can also represent an IP work (image, text...),
in which case the IP law applies.</p>
      <p>But also, if the selection and arrangement of others’ literary and artistic
works under the form of anthologies, databases etc. is the result of an
intellectual creation, the mere collection is also under the umbrella of the intellectual
property law (without prejudice of the rights of the original works’ authors).
This is universally acknowledged and can it be found in the Berne Convention2.</p>
      <p>Intellectual property rights comprise moral rights and exploitation rights.
Moral rights are untransferable and unwaivable in some jurisdictions, and they
include rights as the author being attributed, the work being respected or staying
anonymous. Exploitation rights can be waived, licensed to the public, or traded
in an economic exchange. Thus, the rightsholder of each of the exploitation rights
may change along the time. These rights traditionally include the reproduction
of the work (e.g., making copies), the distribution of copies (e.g., selling, renting
etc.), the public performance, broadcasting or communication to the public and
the transformation (including translation, adaptation etc.). Additionally, the so
called related rights or neighbouring rights concern other categories of owners of
rights different from the authors, namely, performers, producers, broadcasting
organizations etc. A data curator or a dataset translator may also acquire related
rights on the result of their work.</p>
      <p>Third, in some jurisdictions, specific database right laws have been
declared for the protection of databases which do not qualify to be intellectual
property objects. This is the case of Europe, but not the United States, where
no database right exists. This sui generis rights, as defined in Europe, protects
1 Art. 39 in WTO Agreement on Trade Related Aspects of Int. Property Rights (1994)
2 Art. 2.5 in Berne Convention for the Protection of Literary and Artistic Works (1886)
the ”qualitatively and/or quantitatively substantial investment in either the
obtaining, verification or presentation of the contents”3. Extracting or re-utilizing
the whole or a substantial part of the contents is prohibited unless permission is
given. Naturally, exceptions usually exist for the case of educational purposes,
injunction, public security etc., and in any case, after 15 years the database
enters permanently into the public domain.</p>
      <p>
        The combination of intellectual property rights and database rights (where
applicable), generates a set of possible scenarios depending on (a) if the dataset
contents are IP protectable assets or not (b) if the dataset creator has IP rights,
database rights or none of them. Determining which of the scenarios corresponds
to an actual case is not an evident task, as pointed out in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. For example, in
the USA, Canada, Australia or Japan, a dataset with “the best of” a musician
would be regarded as intellectual property object, for it would be a compilation
involving an aesthetic judgment. But a “complete collection of works” of the
same musician wouldn’t, for it would be an automatable task. This collection
would be protected, however, in Europe, if a verification work or any other
similar effort was carried out.
      </p>
      <p>Finally, if personal data is conveyed in the database, data protection laws
have to be considered too4). These laws give no rights to the database creators,
but rather impose certain obligations which have to be respected. These
obligations include implementing security measures to be taken to physically and
digitally protect the information, generating periodic security reports or keeping
data access logs. In some jurisdictions, different levels of protection exist as a
function of how sensitive the information is. As an example, the law in Spain
defines three levels of confidentiality in a personal data file, ranging from the
most trivial information but attributable to a person, to the most sensitive
information like the sexual or religious preferences. Persons whose information is
contained in a file have the right to access and rectify their records, which in
any case can only be gathered for a declared purposed and can only live for a
limited period of time.</p>
      <p>To sum up, these laws ultimately protect the rights of (a) the authors who
have created contents collected in a dataset (b) the dataset creators who have
selected, curated and arranged the registers (c) the individuals whose personal
information is in the dataset (d) third parties damaged if data is disclosed.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Rights Declaration for Linked Data</title>
      <p>To precise the rights declaration for Linked Data, the following levels should
be independently considered: (a) a single RDF triple, as the simplest unit of
information, (b) RDF graphs or RDF datasets, as collections of data, (c) the
3 Art. 7(1) in Directive 96/9/EC on the legal protection of databases (1996)
4 For example, see the corresponding European Directive 95/46/EC on the
protection of individuals with regard to the processing of personal data and on the free
movement of such data (1995)
RDF links, as mappings play the key role in the added value of Linked Data and
(d) external resources referred by RDF.</p>
      <p>Single RDF triples (or a reduced group of them) are not protected by
intellectual property or database laws, which explicitly exclude individual data
from the protection scope –unless a work or a full data collection is contained
in a literal. However, they may be protected as trade secrets or its access by
restricted for other reasons. As with copyrighted material, stamping a top secret
or similar notice is merely informative and no additional protection is conferred
by its addition.</p>
      <p>In general, a RDF dataset matches the legal concept of database5. Its
creator may claim database rights in certain countries, plus intellectual property
rights if the dataset contains works creatively selected and arranged –a claim
difficult to be justified in most of the cases. Database rights do not exist if,
for example, the RDF dataset was only an effortless syntax transformation of
what was included in another database. Other rights may exist over datasets if
they contain trade secrets or personal data whose handling is subject to further
restrictions.</p>
      <p>RDF datasets aggregating data from different RDF sources require the
specific authorization from the different dataset owners or the existence of a public
license allowing to do so –in which case, possibly some conditions will have to be
respected. RDF mappings are collections of triples relating resources in two
or more different RDF datasets. Excepting for the case of automatic mappings,
linking vocabularies or resources is a costly effort which almost immediately
qualifies the work as a protectable asset: RDF mappings are a first class citizen
in the Linked Data ecosystem.</p>
      <p>Referring an external entity is an action always allowed: even if the resource is
not yours, you can freely comment on it –or link it to your concept. But
declaring a mapping (either an added-value mapping or merely re-using mappings
already in the public domain) leads to opening the door to using information
from different RDF resources with possibly a different legal character. The use
of data obtained by following links in RDF mappings may be subject to rights
whose declaration would ease the lawful use of Linked Data. This also applies
to resources referred by RDF subject to protection, although most of users
are possibly aware of this.</p>
      <p>Finally, declaring if a Linked Data resource contains personal data or
confidential information is merely informative, but it can ease its handling and
strengthen the rightsholder in case of litigation. To sum up, for the lawful use of
Linked Data, which may be created, acquired, transformed and published in a
value chain where several parties intervene, a proper holistic rights declaration
is a must.
5 A database is: a collection of independent works, data or other materials arranged
in a systematic or methodical way and individually accessible, in European Directive
96/9/EC</p>
    </sec>
    <sec id="sec-4">
      <title>Linked Data for rights declaration</title>
      <p>If the declaration of rights for RDF data is needed, RDF itself can be the vehicle
for its expression. The basic information to be given informs that a Linked Data
resource (a triple, a graph, a dataset, a mapping,. . . ) is subject to certain rights
and if they are kept (e.g. a copyright statement), unconditionally released (e.g.
a waiver notice) or given subject to certain conditions (e.g. licensed).</p>
      <p>This allows us identifying three questions: which subjects can be attributed
with rights expressions? Which predicates can be used for rights declaration?
And which licenses can be used in the rights declaration? The rest of the section
describes the existing choices to express these pieces of information.
4.1</p>
      <sec id="sec-4-1">
        <title>Properties for Linked Data rights declaration</title>
        <p>The predicate for rights declaration can be taken from Dublin Core (DC),
perhaps the most used vocabulary in Linked Data after the language constructs
(RDF, OWL, etc.): rights is one of the fifteen core properties defined in the
Dublin Core Metadata Element Set6 for use in resource description. Defined as
Information about rights held in and over the resource, it has been generally
used to include descriptions of the copyright information or references to rights
management services. It is present in two different namespaces, usually prefixed
as dc7 and dcterms8.</p>
        <p>This predicate is generic enough as to be used to refer to any of the rights
described in Section 2. Dublin Core specifies two properties refining the rights
property: accessRights (information about who can access the resource or an
indication of its security status) and license (a legal document giving official
permission to do something with the resource). The former may be used to
declare that a resource contains personal data (like a phone number), while the
latter has been extensively used to declare the intellectual property license of a
resource. The Creative Commons property cc:license9, derived from dc:license,
has also been used to point at a well-known license.
4.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>Subjects of Linked Data rights declaration</title>
        <p>The subject of a rights declaration is the piece of information object of the rights,
either a referred resource, an RDF triple, a dataset, or a mapping.</p>
        <p>To declare rights of a referred resource, a simple property can be stated
about the resource. The following example attributes a Creative Commons
CCBY license to an external resource.
6 http://dublincore.org/documents/dces/
7 http://purl.org/dc/elements/1.1/
8 http://purl.org/dc/terms/
9 http://creativecommons.org/ns#</p>
        <p>To declare access restrictions to a RDF triple, a reificated statement can be
attributed with rights declaration. The following example attributes a privacy
statement to a phone number.
@prefix rdf: &lt;http://www.w3.org/1999/02/22-rdf-syntax-ns#&gt; .
_:x rdf:type rdf:Statement ;
rdf:subject ex:Alice ;
rdf:predicate foaf:phone ;
rdf:object "654321987" ;
dcterms:accessRights "PersonalData".}</p>
        <p>Note the use of dcterms:accessRights, which according to Dublin Core can
also be used to give information regarding access or restrictions based on
privacy, security, or other policies. However, on despite of existing a vocabulary for
privacy preferences ontology10, no common term has been accepted to tag that
a piece of information contains personal data and so a simple literal
“PersonalData” has been given: an acknowledged URI is missing here.</p>
        <p>A complete RDF dataset may be attributed within or outside the dataset
it-self. Within the dataset, the most common practice is to attribute the URI of
the dataset as in the example below.
&lt;http://URI-OF-THE-DATASET /&gt;
dcterms:license &lt;http://creativecommons.org/publicdomain/zero/1.0/&gt;.</p>
        <p>The dataset can also be described in a separate RDF graph, possibly based on
the VoID11 or DCAT12 vocabularies. In this case, the instance of void:Dataset,
dcat:Dataset or even of its parent class dctype:Dataset would be attributed the
corresponding rights declaration.</p>
        <p>Finally, RDF mappings can receive the same treatment as RDF datasets,
save that in VoID a dataset subclass is defined: void:LinkSet (a collection of
RDF links between two datasets). This linkset can specify the referred dataset
through the void:target property, which in turn can receive a rights declaration
–for example a public domain license.
http://URI-OF-A-LINKSET&gt; a void:Linkset ; # mapping</p>
        <p>void:target &lt;http://URI-OF-A-DATASET&gt;.
&lt;http://URI-OF-A-DATASET&gt;a void:Dataset . #external dataset</p>
        <p>dcterms:license &lt;http://creativecommons.org/publicdomain/zero/1.0/&gt;.
4.3</p>
      </sec>
      <sec id="sec-4-3">
        <title>Rights declaration for Linked Data</title>
        <p>The rights declaration should convey the information of which rights are held,
waived or licensed. For data licensing, specific data licenses exist and can be
identified by known URIs. It is the case of the Open Data Commons13 (ODC)
licenses, the Creative Commons license CC0 and licenses defined by some
governments. This makes possible and easy the assignment of a license to a RDF
dataset. The most common data licenses are:
10 http://vocab.deri.ie/ppo#
11 http://www.w3.org/TR/void/
12 http://www.w3.org/TR/vocab-dcat/
13 ttp://opendatacommons.org
– Public Domain Licenses. They waive all the possible intellectual property
and neighbouring rights (database rights) of the dataset and its contents.
There are two equivalent choices, the ODC-PDDL (Public Domain
Dedication and License) and the CC0 public domain waiver.
– Attribution Licenses. They waive all the possible rights, requiring only the
mere attribution. Example: ODC-By, attribution for data/databases.
– Share-alike Licenses. The rights are also waived requiring that derived or
adapted databases keep the same license. Examples: ODC-ODBL (Open
Database License), or the UK-OGL (UK Open Government License).
Some other licenses famous have been used, like the general Creative Commons
licenses. These pre-defined licenses are also identifiable by URIs, but they are
intended for general works and do not mention the database rights which might
apply in places like Europe. These Creative Commons licenses always require
attribution (BY), and they may require the share-alike (SA) condition, a
noncommercial flag (NC) or the non-derivatives (ND) restriction. “Non-commercial”
means that the work (nor derived versions thereof) can be use for profit,
nonderivatives means that no transformations of the original work can be published.
The combination of these conditions leads to having licenses known as CC-BY
(only attribution), CC-BY-SA (with share alike), etc.</p>
        <p>The imprecise use of licenses for datatasets is even more evident when licenses
like the GFDL (GNU Free Documentation License) conceived for documents or
even software licenses are used. Attending to their degree of restrictiveness, a
categorization is shown in Table 1.</p>
        <p>
          More complex ad-hoc licenses can be defined with one of the digital Rights
Expression Languages like ODRL (Open Digital Rights Language) [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] or
MPEG21 REL [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], although they are XML based and do not intend to imbricate with
the rest of the web of data as proposed in [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. A new breed of vocabularies,
interconnected and not intended for its use in specific Digital Rights Management
systems is now appearing: vocabularies like LiMO14, L4LOD15 or ODRS16, but
14 http://data.opendataday.it/LiMo
15 http://ns.inria.fr/l4lod/v2/l4lod v2.html
16 http://schema.theodi.org/odrs/
so far only the Creative Commons RDF ccREL [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] has been used by the Linked
Data community.
5
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Current practice in rights declaration in Linked Data</title>
      <p>Quantitatively observing the current practice about rights declaration in Linked
Data is a difficult task as RDF sources are multiple and embracing every piece
of Linked Data in the web is not possible. Yet relevant or extensive parts of it
can be analyzed.</p>
      <p>For example, the LOD cloud is important for being a reference of high quality
data, accounting 338 datasets, although biased regarding licensing: they are
supposed to be openly licensed. A broader collection of datasets, easily accessible,
is that listed in the CKAN archive (Comprehensive Knowledge Archive
Network17), a registry of open data and content packages provided by the OKFN,
excelling for its completeness at cataloguing existing datasets. A more selected
collection of sources, periodically compiled and analyzed is that of the DyLDO18,
in a framework to monitor Linked Data over the time. It includes datasets from
the LOD cloud and the Billion Triple Dataset challenge19. Finally, another source
of study may be Sindice20, a lookup index over resources crawled on the Semantic
Web, which ingests RDF, RDFa and microformats.</p>
      <p>Again recalling the study of Section 4, the questions to be answered by the
experimental work can be formulated as Which subjects are actually attributed
with rights expressions? Which predicates are actually used for rights
declaration? And which licenses are actually used in the rights declaration?
5.1</p>
      <sec id="sec-5-1">
        <title>Rights declaration for Linked Data in practice</title>
        <p>In order to assess the use of licenses, a double test was made: determining which
licenses were in use in the official LOD datasets, and which licenses were in use
in the broader set of the LD datasets in CKAN. The set of LOD datasets could
be obtained by using the REST API of CKAN (the LOD cloud diagram was
formally managed through the CKAN repository). CKAN also records information
about the license of each dataset, as declared at registering time. In a similar
manner, the license in general LD datasets in CKAN was queried.</p>
        <p>As of May 2013, 1,836 Linked Data datasets21 were registered in the CKAN,
belonging 338 of them to the LOD group. Each of the datasets had one or
more resources (i.e. different data files, SPARQL endpoints etc.) but each of
the datasets was homogenously licensed through the resources. The results of
this observation are shown in Table 2, which has grouped the licenses with the
17 http://datahub.io/
18 http://swse.deri.org/dyldo
19 http://km.aifb.kit.edu/projects/btc-2011/
20 http://www.sindice.com/
21 A dataset was considered to be LD if it had one resource marked with a type
containing the following strings: rdf, rdfs, owl, ttl, turtle, nquads, ntriples, nt or sparql.
criteria of Table 1. This grouping hides, nonetheless, the fact that a 29% of the
licenses were intended for works and not specifically for data.</p>
        <p>Disregarding the object where a license has been applied (a RDF dataset,
external resources, etc.), an SPARQL query can be made to observe which kind
of licenses are used in extensive pieces of Linked Data. Having made this query
in Sindice, public domain and attribution licenses again gathered the largest
percent of all the licenses: 63% against the 53% used for CKAN datasets.
Sharealike licenses accounted for a 27%, against the 24% in CKAN datasets and
licenses with restrictions (non-commercial, no derivatives) were 6% in Sindice
against the 11% in CKAN datasets.
5.2</p>
      </sec>
      <sec id="sec-5-2">
        <title>Properties for Linked Data rights declaration in practice</title>
        <p>The goal of this observation is to assess which RDF elements are most used
to specify a license. To achieve this, different SPARQL queries were made on
Sindice, inquiring for each of the most common elements used for licensing.
The results, shown in Table 3 shows the dc:rights as the champion. Yet, this
element is used about one order of magnitude less than the dc:title element.
The queries for Dublin Core included both namespaces as described in Section
4.1.</p>
        <p>More licensing elements proposed in other vocabularies were also tested, but
their presence in Sindice was neglectable if not zero. These vocabularies included
properties as the DOAP22 doap:license, the PREMIS23 premis:licenseTerms,
the OMV24 omv:hasLicense, the Music Ontology25 mo:License, the VAEM26
vaem:hasLicenseType, or more sofisticated classes in Dublin Core as dcterms:
RightsStatement or dcterms:LicenseDocument.
5.3</p>
      </sec>
      <sec id="sec-5-3">
        <title>Subjects of Linked Data rights declaration in practice</title>
        <p>In the previous sections, the RDF triple, the RDF dataset and the RDF
mapping had been identified as the key ingredients of Linked Data. In the following
experiment, Sindice was queried to learn how often a licensing property had been
applied to rdf:Statements, void:Datasets and void:Linksets.</p>
        <p>The experiment revealed that rights declaration had been expressed
unevenly for these levels. Sindice included 48,968 reificated statemenets, of which
13,505 had rights information, but coming from exclusively a single dataset.
RDF Datasets declared with void:Dataset accounted a total number of 4,549,
of which 92 used a Dublin Core rights and 26 a Dublin Core license. Finally,
none of the 1,163 mappings declared with void:Linkset and found by Sindice
had rights information.
6</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>
        An ecosystem of entities (public bodies, academic institutions, enterprises, etc.)
producing, transforming and consuming Linked (Open) Data in a marketplace
is now starting to bloom [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], and it will presumable flourish more healthy if
enough guarantees exist for all the parties in the value chain and their rights.
However, the mismatch between the needs described in Sections 2 and 3 and the
practices observed in Section 5 lead to formulating a series of pending challenges:
1. Vocabularies for declaring rights information exist, but are not complete.
      </p>
      <p>Terms like the Dublin Core license and rights have gained popularity (as
shown in Section 4.1), but they fail to be precise. While it is vaguely assumed
that the rights or licenses are IP related, other legal concerns as the privacy
statements or confidentiality stamps (Section 2) are ignored.
2. Vocabularies for licensing terms exist, but they need further development.</p>
      <p>Some existing licenses are now well known and widely accepted. But specific
terms of use are still referenced in natural text. The new vocabularies for
licensing LD which are now sprouting should become more mature, better
documented and accompanied of easy tools for producing rights expressions.
22 http://usefulinc.com/ns/doap
23 http://multimedialab.elis.ugent.be/users/samcoppe/ontologies/Premis/premis.owl
24 http://omv.ontoware.org/2005/05/ontology
25 http://musicontology.com/
26 http://www.linkedmodel.org/schema/vaem</p>
      <p>As these leaks are not intrinsic of Linked Data, and they are technically
solvable with appropriate vocabularies, standards and tools, it can be expected
that the development of new LD business models will gradually bridge the gap.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Klyne</surname>
            <given-names>G.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Carroll</surname>
          </string-name>
          , J. J., eds. Resource Description Framework (RDF):
          <article-title>Concepts and Abstract Syntax</article-title>
          .
          <source>W3C Recommendation</source>
          . (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Cobden</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          et al.:
          <article-title>A research agenda for linked closed data</article-title>
          ,
          <source>in Proc. of the 2nd Int. Workshop on Consuming Linked Data</source>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Servant</surname>
            ,
            <given-names>F.P.</given-names>
          </string-name>
          :
          <article-title>Linking enterprise data</article-title>
          ,
          <source>in Proc. of WWW Workshop Linked Data on the Web</source>
          , vol.
          <volume>369</volume>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Villata</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Delaforge</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gandon</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Gyrard</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>An Access Control Model for Linked Data. In On the Move to Meaningful Internet Sys</article-title>
          ., pp.
          <fpage>454</fpage>
          -
          <lpage>463</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Aliprandi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Open licensing and databases</article-title>
          .
          <source>Int. Free and Open Source Software Law Review</source>
          , North America,
          <volume>4</volume>
          (
          <issue>1</issue>
          ), pp.
          <fpage>5</fpage>
          -
          <lpage>18</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Ianella</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Guth</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <source>ODRL Version 2</source>
          .0 Common Vocabulary, W3C Community Group Final Specification (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7. ISO/IEC 21000-5:
          <fpage>2004</fpage>
          , Information Technology- Multimedia
          <string-name>
            <surname>Framework</surname>
          </string-name>
          (
          <year>MPEG21</year>
          )
          <article-title>- Part 5</article-title>
          :
          <string-name>
            <given-names>Rights</given-names>
            <surname>Expression Language</surname>
          </string-name>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Rodr</surname>
          </string-name>
          <article-title>´ıguez-</article-title>
          <string-name>
            <surname>Doncel</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Delgado</surname>
          </string-name>
          , J.:
          <article-title>Towards an Expression Language for Licensing Content in the Connected Semantic Web</article-title>
          ,
          <source>in: Proc. of the 9th Int. Workshop on Virtual Goods</source>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Abelson</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Adida</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Linksvayer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Yergler</surname>
          </string-name>
          , N.:
          <article-title>ccREL: The Creative Commons Rights Expression Language</article-title>
          .
          <source>Technical report</source>
          . (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Villata</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Gandon</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Licenses Compatibility and Composition in the Web of Data</article-title>
          .
          <source>in Proc.of the 2nd Int. Workshop on Consuming Linked Data</source>
          . (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Harris</surname>
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Selling and Building Linked Data: Drive Value and Gain Momentum</article-title>
          ,
          <source>in Linking Enterprise Data</source>
          , pp.
          <fpage>65</fpage>
          -
          <lpage>76</lpage>
          , ed. Springer (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>