ShareAlike Your Data
Markus Krötzsch, Sebastian Speiser
ShareAlike Your Data: Self-Referential Usage Policies for the Semantic Web
Abstract. Numerous forms of policies, licensing terms, and related conditions are
associated with Web data and services. A natural goal for facilitating the
re-use and re-combination of such content is to model usage policies as part of
the data so as to enable their exchange and automated processing. This paper
thus proposes a concrete policy modelling language. A particular difficulty are
self-referential policies such as Creative Commons ShareAlike,
that mandate that derived content is published under some license with the same
permissions and requirements. We present a general semantic framework for
evaluating such recursive statements, show that it has desirable formal
properties, and explain how it can be evaluated using existing tools. We then
show that our approach is compatible with both OWL DL and Datalog, and
illustrate how one can concretely model self-referential policies in these
languages to obtain the desired conclusions.
Published at ISWC2011 (Conference paper)
Download PDF (last update: Oct 25 2011)
Citation details
- Markus Krötzsch, Sebastian Speiser. ShareAlike Your Data: Self-Referential Usage Policies for the Semantic Web. In Lora Aroyo, Chris Welty, Harith Alani, Jamie Taylor, Abraham Bernstein, Lalana Kagal, Natasha Noy, Eva Blomqvist, eds.: Proceedings of the 10th International Semantic Web Conference. SpringerProperty "Publisher" has a restricted application area and cannot be used as annotation property by a user. 2011.
author = {Markus Kr{\"o}tzsch and Sebastian Speiser},
title = {{ShareAlike} Your Data: Self-Referential Usage
Policies for the {Semantic Web}},
booktitle = {Proceedings of the 10th International Semantic
Web Conference (ISWC'11)},
editor = {Lora Aroyo and Chris Welty and Harith Alani and
Jamie Taylor and Abraham Bernstein and
Lalana Kagal and Natasha Noy and Eva Blomqvist},
publisher = {Springer},
series = {LNCS},
volume = {7032},
year = {2011}
}
Remarks
There is also an extended technical report that reports the results of this work and that includes all proofs that did not fit the conference publication.
Legal notice: This work has been published in Springer LNCS 7032.