ODRL Policy Comparison Through Normalisation

TL;DR

This paper introduces a normalization approach for ODRL policies that simplifies their structure, making comparison and processing more efficient by reducing complex policies to minimal, equivalent forms.

Contribution

It proposes algorithms for normalizing ODRL policies into minimal components, preserving semantics and enabling easier comparison and interoperability.

Findings

Algorithms preserve policy semantics.

Normalization reduces complexity of policy comparison.

Exponential size growth with attributes, linear with attribute values.

Abstract

The ODRL language has become the standard for representing policies and regulations for digital rights. However its complexity is a barrier to its usage, which has caused many related theoretical and practical works to focus on different, and not interoperable, fragments of ODRL. Moreover, semantically equivalent policies can be expressed in numerous different ways, which makes comparing them and processing them harder. Building on top of a recently defined semantics, we tackle these problems by proposing an approach that involves a parametrised normalisation of ODRL policies into its minimal components which reformulates policies with permissions and prohibitions into policies with permissions exclusively, and simplifies complex logic constraints into simple ones. We provide algorithms to compute a normal form for ODRL policies and simplifying numerical and symbolic constraints. We prove that these algorithms preserve the semantics of policies, and analyse the size complexity of the result, which is exponential on the number of attributes and linear on the number of unique values for these attributes. We show how this makes complex policies representable in more basic fragments of ODRL, and how it reduces the problem of policy comparison to the simpler problem of checking if two rules are identical.