<!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>Automatic License Compatibility Checking</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Giray Havur</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Simon Steyskal</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oleksandra Panasiuk</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anna Fensel</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Victor Mireles</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tassilo Pellegrini</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Thomas Thurner</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Axel Polleres</string-name>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sabrina Kirrane</string-name>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>STI Innsbruck, University of Innsbruck</institution>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Siemens AG Österreich</institution>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>St. Pölten University of Applied Sciences</institution>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>The Semantic Web Company</institution>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>Vienna University of Economics and Business</institution>
          ,
          <country country="AT">Austria</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper, we introduce the Data Licenses Clearance Center system, which not only provides a library of machine readable licenses but also allows users to compose their own license. A demonstrator can be found at https://www.dalicc.net. Licensing in general and rights clearance in particular are complex topics that require a high level of domain expertise and legal expertise. Primary challenges include the high transaction costs associated with the manual clearance of licensing terms and conditions; the need for suficient expertise to detect compatibility conflicts between licenses; and the ability to resolve such conflicts. An alternative approach could be to model licenses in a manner that supports automatic license compatibility checking. Among the most prominent Rights Expression Language (REL) vocabularies used to represent licenses are the Creative Commons Rights Expression Language (ccREL)6, the Open Digital Rights Language (ODRL)7, and an ODRL profile called RightsML 8. When it comes to reasoning over license representations, an early proposal for a generic logic for reasoning is provided by Pucella and Weissman [7], but it has not been implemented with existing RELs like ODRL or MPEG-21 nor has it been evaluated in practice. García and Gil [2] propose an ontology to describe copyright issues in closed datasets for rights clearance purposes. Hosking et al.[6] present a rule-based engine, built on top of the Carneades Framework [3], to reason over various sets of licenses, while additionally suggesting potential licenses by which to safely share derived outputs. Instead of applying deductive reasoning they used a non-monotonic formalism suitable for modeling situations in which contradictory statements are being processed. Villata and Gandon [8] and Governatori et al. [4] describe the formalization of a license composition tool for derivative works. They extend their 6 https://www.w3.org/Submission/ccREL/ 7 https://www.w3.org/TR/odrl-model/ 8 https://iptc.org/standards/rightsml/</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>License
odrl:Policy 
odrl:permission y odrl:obligation odrl:prohibition
t
u
odrl:Permission  : odrl:Duty 
d
l
r
d
o odrl:action
odrl:Action 
owl:sameAs 
odrl:includedIn
odrl:implies
dalicc:contradicts
Dependency Graph
dalicc:needsPermission
dalicc:needsDuty
dalicc:needsProhibition
dalicc:Question  dalicc:excludesPermission</p>
      <p>
        dalicc:excludesDuty
dalicc:question dalicc:excludesProhibition
dalicc:Questionnaire  Questionnaire
research by introducing semantics based on a deontic logic [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] for the comparison
of the permissions, prohibitions and duties stated in a given license. The
limitation of existing work is the fact that compatibility can just be checked against
a handful of selected permissions, obligations and prohibitions and not against
a selection of licenses. In this paper, we present the Data Licenses Clearance
Center (DALICC) system9, which focuses on extending existing vocabularies to
enable modeling and reasoning over several well-known license texts. With this
demo we aim to demonstrate: (i) our machine ODRL representation for a
number of well-known license families (CC, Apache, BSD, MIT, GPL); and (ii) the
DALICC system that can be used to both generated custom licenses and check
automatically check license compatibility.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Modelling Licenses using ODRL</title>
      <p>In DALICC licenses are modelled using ODRL, which was recently released
as a W3C recommendation. The model is further extended with a dependency
graph, which is necessary for checking license consistency, and a model that
underpins a dynamic questionnaire that enables users of the DALICC system
to search for licenses. Figure 1 depicts the central role of odrl:Action in
integrating the licenses, dependency graph and questionnaire. For the modelling,
we selected 14 commonly used licenses from 5 license families (CC, Apache,
MIT, BSD, GPL), which can be applied to various data assets, such as
creative works, software and datasets. The ODRL information model is
particularly suitable for modeling licenses in the form of policies that express
permissions, prohibitions and duties related to the usage of assets. ODRL also
defines a vocabulary of general terms (e.g., odrl:reproduce, odrl:distribute,
odrl:modify) that can be further extended with terms from other vocabularies
such as CC REL10. However, during our analysis we identified the need for
additional terms (e.g., dalicc:perpetual as a validity type, dalicc:worldwide as a
9 https://www.dalicc.net/
10 https://creativecommons.org/ns#
jurisdictional property, dalicc:chargeLicenseFee as permission and prohibition
actions, and dalicc:modificationNotice as a duty action), which we modelled
using the DALICC vocabulary. DALICC utilizes a dependency graph for
representing the semantic relationship between denfied actions. The core function
of the dependency graph is to encode expert knowledge about the implicit and
explicit semantic dependencies between actions. The corresponding dependency
graph represents the semantics of an action in another action (e.g., odrl:sell
odrl:includedIn odrl:commercialize), implications derived from a specific
action (e.g., cc:Attribution odrl:implies cc:Notice), equalities (e.g., odrl:copy
owl:sameAs odrl:reproduce), and contradictions between specific actions (e.g.,
cc:ShareAlike dalicc:contradicts dalicc:addStatement). Additionally, the
DALICC questionnaires are encoded using RDF, enabling multilingual interfaces and
rapid refactoring using the RDF editing capabilities of PoolParty Semantic Suite.
To this end, we have created four controlled vocabularies, one each for: (i)
questions, (ii) question types, (iii) interaction between the UI and the License Search,
and (iv) interaction between the UI and the Composer. Each question is an
instance of dalicc:Question class, a subclass of skos:Concept, with three
attributes that define their appearance and behaviour in the UI: skos:prefLabel,
skos:definition, and rdf:type, all of which are adopted by the DALICC system.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Reasoning</title>
      <p>
        To reason over licenses we use Answer Set Programming (ASP)[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], a declarative
(logic-programming-style) paradigm for solving combinatorial search problems
by defining and evaluating rule sets. Licenses are represented in ASP as a set of
rules of the form rule(L,C,I, ,T) where L, C, I,  , and T correspond to license
name, category of rule, assignee, action, and asset, respectively.
      </p>
      <p>Policies are derived from the RDF graphs of the licenses. Herein, a rule that
permits or prohibits the execution of an action on certain assets does not only
afect other rules that govern the execution of the same action on the same
asset(s) but also those permitting or prohibiting related actions on the same
asset(s). In this sense, clingo is an alternative to extensive materialization, which
in this case is essential for search, and also enables listing sets of compatible
statements. This is necessary for efective computation of conflicts between
licences, in particular for identifying the conflicting and non-conflicting parts of
a license.
4</p>
    </sec>
    <sec id="sec-4">
      <title>The DALICC System</title>
      <p>The DALICC framework consists of the three main functional components,
namely: license library, license search, and license composer, as shown in Figure
2. The DALICC system, which is an implementation of the DALICC framework
is the result of coupling a Virtuoso11 triplestore, a Drupal12 based web
application, the PoolParty Semantic Suite13, and a Clingo Answer Set Programming
11 https://virtuoso.openlinksw.com/
12 https://www.drupal.org
13 https://www.poolparty.biz/
License Library</p>
      <p>License Search</p>
      <p>License Composer
Reasoner</p>
      <p>Data Sources</p>
      <p>DepLQeicnuedenessnteiocLyninbGarraiarrepy,h &amp; CuLsictoemnsizeed
(ASP) reasoner14. This web application provides the user with three diferent
workflows that cover the functionality of the framework: (i) displaying the
licenses in the license library; (ii) searching for a license that meets the user’s
needs; and (iii) composing customized licenses from scratch. The license library is
a repository that contains machine-readable and human-readable representations
of the licenses. Licenses properties are queried using SPARQL and presented to
the user in an easily digestible manner, as seen in Figure 3. In the case of license
search (cf. Figure 4), the user fills in a dynamic questionnaire which is used to
ifnd the most suitable license based on their individual needs via communicating
with the reasoner. When the form is submitted, the underlying JavaScript
triggers a SPARQL query that retrieves the actions of type odrl:action and other
relations with respect to the answer. Afterwards, this information is sent to the
reasoner so that the reasoner returns the licenses that are consistent with the
given input. The license composer (cf. Figure 5) is a tool that allows customized
licenses to be easily created from a set of questions which are mapped to ODRL,
ccREL and DALICC vocabularies. In order to ensure the validity of the machine
readable licenses and the corresponding license compatibility assessment, both
14 https://potassco.org/clingo/
the development and the testing of the platform’s components have been carried
out in close collaboration with legal experts within the DALICC consortium.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>In this paper, we discussed how licenses can be modeled using various Rights
Expression Languages and how reasoning can be applied to detect licensing
conflicts. The DALICC demonstrator is a viable proof of concept and illustrates
the practical applicability of semantic technologies for legal purposes. We are
planning to mature the system and extend its functional scope from license
management towards policy management.</p>
      <p>Acknowledgements. DALICC was funded by the Austrian Federal Ministry
of Transport, Innovation and Technology (BMVIT) under the program “ICT of
the Future”. More information is available at https://iktderzukunft.at/en/
and https://dalicc.net/.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>G.</given-names>
            <surname>Brewka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Eiter</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Truszczyński</surname>
          </string-name>
          .
          <article-title>Answer set programming at a glance</article-title>
          .
          <source>Communications of the ACM</source>
          ,
          <volume>54</volume>
          (
          <issue>12</issue>
          ),
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>R.</given-names>
            <surname>García</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Gil</surname>
          </string-name>
          .
          <article-title>Copyright licenses reasoning using an owl-dl ontology</article-title>
          .
          <source>Law, Ontologies and the Semantic Web: Channelling the Legal Information Flood</source>
          ,
          <volume>188</volume>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>T. F.</given-names>
            <surname>Gordon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Prakken</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Walton</surname>
          </string-name>
          .
          <article-title>The Carneades model of argument and burden of proof</article-title>
          .
          <source>Artificial Intelligence</source>
          ,
          <volume>171</volume>
          (
          <fpage>10</fpage>
          -15):
          <fpage>875</fpage>
          -
          <lpage>896</lpage>
          ,
          <year>July 2007</year>
          . ISSN 00043702. doi:
          <volume>10</volume>
          .1016/j.artint.
          <year>2007</year>
          .
          <volume>04</volume>
          .010. URL http://linkinghub. elsevier.com/retrieve/pii/S0004370207000677.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>G.</given-names>
            <surname>Governatori</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.-P.</given-names>
            <surname>Lam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rotolo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Villata</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. A.</given-names>
            <surname>Atemezing</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F. L.</given-names>
            <surname>Gandon</surname>
          </string-name>
          .
          <article-title>Live: a tool for checking licenses compatibility between vocabularies and data</article-title>
          .
          <source>In International Semantic Web Conference</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>G.</given-names>
            <surname>Guido</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Ho-Pun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Antonino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Serena</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Fabien</surname>
          </string-name>
          .
          <article-title>Heuristics for Licenses Composition</article-title>
          .
          <source>Frontiers in Artificial Intelligence and Applications</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>R.</given-names>
            <surname>Hosking</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gahegan</surname>
          </string-name>
          , and
          <string-name>
            <surname>G. Dobbie.</surname>
          </string-name>
          <article-title>An escience tool for understanding copyright in data driven sciences</article-title>
          .
          <source>In 10th IEEE International Conference on e-Science</source>
          , eScience
          <year>2014</year>
          ,
          <string-name>
            <given-names>Sao</given-names>
            <surname>Paulo</surname>
          </string-name>
          , Brazil,
          <source>October 20-24</source>
          ,
          <year>2014</year>
          , pages
          <fpage>145</fpage>
          -
          <lpage>152</lpage>
          ,
          <year>2014</year>
          . doi:
          <volume>10</volume>
          .1109/eScience.
          <year>2014</year>
          .37. URL https://doi.org/10. 1109/eScience.
          <year>2014</year>
          .
          <volume>37</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>R.</given-names>
            <surname>Pucella</surname>
          </string-name>
          and
          <string-name>
            <given-names>V.</given-names>
            <surname>Weissman</surname>
          </string-name>
          .
          <article-title>A Logic for Reasoning About Digital Rights</article-title>
          .
          <source>In Proceedings of the 15th IEEE Workshop on Computer Security Foundations, CSFW '02</source>
          , pages
          <fpage>282</fpage>
          -
          <lpage>294</lpage>
          , Washington, DC, USA,
          <year>2002</year>
          .
          <source>IEEE Computer Society. ISBN 0-7695-1689-0</source>
          . URL http://dl.acm.org/citation.cfm?id=
          <volume>794201</volume>
          .
          <fpage>795182</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>S.</given-names>
            <surname>Villata</surname>
          </string-name>
          and
          <string-name>
            <given-names>F.</given-names>
            <surname>Gandon</surname>
          </string-name>
          .
          <article-title>Licenses compatibility and composition in the web of data</article-title>
          .
          <source>In Third International Workshop on Consuming Linked Data (COLD2012)</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>