Name
Abstract | ||
|---|---|---|
Web applications facilitate combining resources (linked data, web services, source code, documents, etc.) to create new ones. For a resource producer, choosing the appropriate license for a combined resource is not easy. It involves choosing a license compliant with all the licenses of combined resources and analysing the reusability of the resulting resource through the compatibility of its license. The risk is either, to choose a license too restrictive making the resource difficult to reuse, or to choose a not enough restrictive license that will not sufficiently protect the resource. Finding the right trade-off between compliance and compatibility is a difficult process. An automatic ordering over licenses would facilitate this task. Our research question is: given a license l(i), how to automatically position l(i) over a set of licenses in terms of compatibility and compliance? We propose CaLi, a model that partially orders licenses. Our approach uses restrictiveness relations among licenses to define compatibility and compliance. We validate experimentally CaLi with a quadratic algorithm and show its usability through a prototype of a license-based search engine. Our work is a step towards facilitating and encouraging the publication and reuse of licensed resources in the Web of Data. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-21348-0_17 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Restrictiveness,Information retrieval,Source code,Computer science,Reuse,Usability,Linked data,Web application,Web service,Database,License | Conference | 11503 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benjamin Moreau | 1 | 0 | 0.68 |
| Patricia Serrano-alvarado | 2 | 142 | 17.21 |
| Matthieu Perrin | 3 | 11 | 7.99 |
| Emmanuel Desmontils | 4 | 47 | 11.19 |