Modelling the Compatibility of Licenses

Moreau, B.; Serrano-Alvarado, Patricia; Perrin, Matthieu; Desmontils, Emmanuel

doi:10.1007/978-3-030-21348-0_17

Cited by 4 publications

(7 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additionally, Cabrio et al [77] propose methods to automatically extract machine-readable licenses from unstructured text. From a reasoning perspective, license compatibility validation and composition techniques [193,345,519] can be used to combine knowledge graphs that are governed by different licenses. Such techniques are employed by the the Data Licenses Clearance Center (DALICC), which includes a library of standard machine readable licenses, and tools that enable users both to compose arbitrary custom licenses and also to verify the compatibility of different licenses [388].…”

Section: Usage Controlmentioning

confidence: 99%

Knowledge Graphs

Hogan,

Blomqvist,

Cochez

et al. 2020

Preprint

View full text Add to dashboard Cite

In this paper we provide a comprehensive introduction to knowledge graphs, which have recently garnered significant attention from both industry and academia in scenarios that require exploiting diverse, dynamic, large-scale collections of data. After some opening remarks, we motivate and contrast various graph-based data models and query languages that are used for knowledge graphs. We discuss the roles of schema, identity, and context in knowledge graphs. We explain how knowledge can be represented and extracted using a combination of deductive and inductive techniques. We summarise methods for the creation, enrichment, quality assessment, refinement, and publication of knowledge graphs. We provide an overview of prominent open knowledge graphs and enterprise knowledge graphs, their applications, and how they use the aforementioned techniques. We conclude with high-level future research directions for knowledge graphs.

show abstract

Section: Usage Controlmentioning

confidence: 99%

Knowledge Graphs

Hogan,

Blomqvist,

Cochez

et al. 2020

Preprint

View full text Add to dashboard Cite

show abstract

“…CaLi [21,22], is a lattice-based model for license orderings. It automatically positions a license over a set of licenses in terms of compatibility and compliance.…”

Section: Compatibility Graph Of Licensesmentioning

confidence: 99%

“…A join-aware source selection [34], selects the capable datasets for each triple pattern of a query. Using a compatibility graph of licenses [22], we search for licenses compliant with each license of the chosen capable datasets. Then, the query is executed and the result set returned with the licenses that can protect it.…”

Section: A Federated License-aware Query Processing Strategymentioning

confidence: 99%

“…If l j is compliant with l i , then l i is compatible with l j . Unfortunately, it is not always possible to find a license compliant with each license of datasets involved in a federated query [22]. If such a license does not exist, the query result cannot be licensed and, thus, should not be reused nor published.…”

Section: Introductionmentioning

confidence: 99%

“…If necessary, it applies distributed query relaxation to propose a set of most similar relaxed federated queries whose result set can be licensed. Our solution combines existing approaches, namely, CaLi [22] to maintain a compatibility graph of licenses dynamically and to detect license conflicts, OMBS [8] to efficiently find relaxed queries and data summaries of CostFed [34] to limit communication overhead during the federated query relaxation. Our contributions are:…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Ensuring License Compliance in Linked Data with Query Relaxation

Moreau¹,

Serrano-Alvarado

2021

Transactions on Large-Scale Data- And Knowledge-Centered Systems XLIX

Self Cite

View full text Add to dashboard Cite

When two or more licensed datasets participate in evaluating a federated query, to be reusable, the query result must be protected by a license compliant with each license of the involved datasets. Due to incompatibilities or contradictions among licenses, such a license does not always exist, leading to a query result that cannot be licensed nor reused on a legal basis. We propose to deal with this issue during the federated query processing by dynamically discarding datasets of conflicting licenses. However, this solution may generate an empty query result. To face this problem, we use query relaxation techniques. Our problem statement is, given a SPARQL query and a federation of licensed datasets, how to guarantee a relevant and non-empty query result whose license is compliant with each license of involved datasets? To detect and prevent license conflicts, we propose FLiQue, a license-aware query processing strategy for federated query engines. Our challenge is to limit communication costs when the query relaxation process is necessary. Experiments show that FLiQue guarantees license compliance, and if necessary, can find relevant relaxed federated queries with a limited overhead in terms of execution time.

show abstract

A License-Based Search Engine

Moreau

Serrano-Alvarado

Perrin

et al. 2019

The Semantic Web: ESWC 2019 Satellite Events

Self Cite

View full text Add to dashboard Cite

The reuse of licensed resources to produce new ones is very common and encouraged on the Web. But producing resources whose licenses are compliant with all reused resource licenses is not easy. It is necessary to know (1) the set of licenses with which the license of the produced resource is compliant and (2) what are the available resources whose licenses are part of this set. With CaLi, we provide an answer to the first concern. CaLi is a lattice-based model that partially orders licenses in terms of compatibility and compliance. In this demonstration, we illustrate the usability of CaLi through a prototype for the second concern. That is, based on a CaLi ordering of licenses we implement a license-based search engine which can answer questions such as "find licensed resources that can be reused under a given license" or "find licensed resources that can reuse a resource that has a particular license".

show abstract

Modelling the Compatibility of Licenses

Cited by 4 publications

References 10 publications

Knowledge Graphs

Knowledge Graphs

Ensuring License Compliance in Linked Data with Query Relaxation

A License-Based Search Engine

Contact Info

Product

Resources

About