<!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>Licentia: a Tool for Supporting Users in Data Licensing on the Web of Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Cristian Cardellino</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Serena Villata</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabien Gandon</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Guido Governatori</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ho-Pun Lam</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Antonino Rotolo</string-name>
          <email>antonino.rotolo@unibo.it</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>INRIA Sophia Antipolis</institution>
          ,
          <country country="FR">France -</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>NICTA Queensland Research Laboratory</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Bologna</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Associating a license to data is a fundamental task when publishing data on the Web. However, in many cases data producers and publishers are not legal experts, and they usually have only a basic knowledge about the possible constraints they want to ensure concerning the use and reuse of their data. In this paper, we propose a framework called Licentia that o ers to the data producers and publishers a suite of services to deal with licensing information. In particular, Licentia supports, through a user-friendly interface, the users in selecting the license that better suits their needs, starting from the set of constraints proposed to regulate the terms of use and reuse of the data.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        In order to ensure the high quality of the data published on the Web of Data,
part of the self-description of the data should consist in the licensing terms
which specify the admitted use and re-use of the data by third parties. This
issue is relevant both for data publication as underlined in the \Linked Data
Cookbook"1 where it is required to specify an appropriate license for the data,
and for the open data publication as expressing the constraints on the reuse of
the data would encourage the publication of more open data. The main problem
is that data producers and publishers often do not have extensive knowledge
about the existing licenses, and the legal terminology used to express the terms
of data use and reuse. To address this open issue, we present Licentia, a suite
of services to support data producers and publishers in data licensing by means
of a user-friendly interface that masks to the user the complexity of the legal
reasoning process. In particular, Licentia o ers two services: i) the user selects
among a pre-de ned list those terms of use and reuse (i.e., permissions,
prohibitions, and obligations) she would assign to the data and the system returns
the set of licenses meeting (some of) the selected requirements together with
the machine readable licenses' speci cations, and ii) the user selects a license
and she can verify whether a certain action2 is allowed on the data released
under such license. Licentia relies on the dataset of machine-readable licenses
(RDF, Turtle syntax, ODRL vocabulary3 and Creative Commons vocabulary4)
available at http://datahub.io/dataset/rdflicense. We rely on the
deontic logic presented by Governatori et al. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] to address the problem of verifying
the compatibility of the licensing terms in order to nd the license compatible
with the constraints selected by the user. The need for licensing compatibility
checking is high, as shown by other similar services (e.g., Licensius5 or Creative
Commons Choose service6). However, the advantage of Licentia with respect to
these services is twofold: rst, in these services compatibility is pre-calculated
among a pre-de ned and small set of licenses, while in Licentia compatibility is
computed at runtime and we consider more than 50 heterogeneous licenses;
second, Licentia provides a further service that is not considered by the others, i.e.,
it allows to select a license from our dataset and verify whether some selected
actions are compatible with such license.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Licentia: services for supporting data licensing</title>
      <p>
        Licentia is implemented as a Web service 7. It is written as a Play Framework
application in Scala and Java, using the Model-View-Controller architecture, and
powered with SPINdle [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] Java library as background reasoner. The architecture
of the Web service is shown in Fig. 1. The work ow is de ned by three steps:
selection and speci cation of licensing conditions, reasoning and incompatibility
checking, and process and return of results.
      </p>
      <p>
        Selection and speci cation of conditions. Using the web interface form, the data
producer and publisher speci es a set of licensing conditions she wants to
associate to the data. These conditions are divided into three categories:
permissions (e.g., Distribution), obligations (e.g., Attribution) and prohibitions (e.g.,
Commercial Use). The chosen set of conditions is taken by a server side
controller, which also gets, through a SPARQL endpoint from a RDF triplestore
server containing our licenses repository, a list of the stored licenses and their
corresponding conditions. This data is delivered to a module that handles the
information and formalizes it into defeasible logic rules for process in SPINdle8 {
a modular and e cient reasoning engine for defeasible logic and modal defeasible
2 In the interface, we adopt the terminology and the rights of the ODRL vocabulary.
3 http://www.w3.org/ns/odrl/2/
4 http://creativecommons.org/ns
5 http://oeg-dev.dia.fi.upm.es/licensius/
6 https://creativecommons.org/choose/
7 A demo video of Licentia showing the nding licenses service is available at http:
//wimmics.inria.fr/projects/licentia/.
8 http://spin.nicta.org.au/spindle/index.html
logic [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Licentia is based on the logic and the licenses compatibility veri cation
process proposed by Governatori et al. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The module translates the licenses
and the set of conditions from the RDF speci cation to defeasible logic rules so
that SPINdle can reason over them. The module considers every single license in
the repository and compares them to the list of conditions selected by the user.
Reasoning and incompatibility checking. SPINdle returns a set of conclusions
for each license's conditions compared to the set of conditions selected by the
user. From these conclusions, the module gets the set of incompatible conditions
chosen by the user with respect to each license: all defeasible non provable rules
are incompatible conditions. If this list is empty, then the license is compatible to
the set of conditions the user selected. After the module gets all the conclusions
for each license, it has two partial results: one containing compatible licenses, and
one containing incompatible ones. If the set of compatible licenses is non empty,
the module divides this set in two parts: one with those licenses containing the
complete set of user's conditions, and the other with those licenses that do not
contain all the user's conditions (but still are compatible), highlighting those
user's conditions that are not explicitly mentioned in such license. If the set of
compatible licenses is empty, the module returns the set of incompatible licenses
along with a list highlighting for each license what are the user's conditions that
are incompatible with the license.
      </p>
      <p>
        Process and return of results. If a set of compatible licenses is returned, the
controller provides a view listing all the licenses that are compatible and contain
the user's selected conditions on the top of the page. Secondly, it returns a list
of all other compatible licenses that do not share all of the user's conditions, in
ascending order by the number of not contained conditions, highlighting each of
the user's conditions that are not explicitly de ned in the license. If the set of
incompatible licenses is returned, the controller lters all licenses not matching
any of the conditions the user selected, keeping those licenses containing at least
one of the conditions chosen by the user. If the ltered set is non empty, the
system shows a message stating there is no license in the repository compatible
with the selected conditions, but there exist some licenses that meet some of
the conditions. Such licenses are thus listed in ascending order by number of
incompatible conditions, highlighting every unmet condition. In any case, the
list provides a link to the legal speci cation of the license as well as a link to
a downloadable RDF version of the license. If no compatible license is found
then a disclaimer is shown. Note that the evaluation of the performances of the
SPINdle9 reasoning module to verify the compatibility of licensing terms has
been presented in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Future Perspectives</title>
      <p>
        In this demo, we present the Licentia tool that proposes a set of services for
supporting users in data licensing. We are currently nalizing the second service
(veri cation of compatible actions with respect to a speci c license), and we
are increasing the number of considered machine readable licenses. We plan to
extend Licentia by integrating an improved version of the generator of RDF
licenses speci cations from natural language texts introduced in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Finally, a
user evaluation should not be underestimated in order to improve the usability
of the user interface.
9 SPINdle has been experimentally tested against the benchmark of [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] showing that
it is able to handle very large theories, indeed the largest theory it has been tested
with has 1 million rules.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Cabrio</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aprosio</surname>
            ,
            <given-names>A.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Villata</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>These are your rights - a natural language processing approach to automated rdf licenses generation</article-title>
          .
          <source>In: ESWC. Lecture Notes in Computer Science</source>
          , vol.
          <volume>8465</volume>
          , pp.
          <volume>255</volume>
          {
          <fpage>269</fpage>
          . Springer (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Governatori</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rotolo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Villata</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gandon</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>One license to compose them all - a deontic logic approach to data licensing on the web of data</article-title>
          .
          <source>In: ISWC. Lecture Notes in Computer Science</source>
          , vol.
          <volume>8218</volume>
          , pp.
          <volume>151</volume>
          {
          <fpage>166</fpage>
          . Springer (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Lam</surname>
            ,
            <given-names>H.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Governatori</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>The making of SPINdle</article-title>
          .
          <source>In: Proceedings of RuleML, LNCS 5858</source>
          . pp.
          <volume>315</volume>
          {
          <fpage>322</fpage>
          . Springer (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Maher</surname>
            ,
            <given-names>M.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rock</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Antoniou</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Billington</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Miller</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>E cient defeasible reasoning systems</article-title>
          .
          <source>International Journal of Arti cial Intelligence Tools</source>
          <volume>10</volume>
          ,
          <issue>483</issue>
          {
          <fpage>501</fpage>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>