This document specifies the expected behaviour of an ODRL Evaluator, a piece of software that performs computations based on a set of policies and a certain state of the world.

Introduction

The Open Digital Rights Language (ODRL) is a policy expression language that can be used to represent permitted, prohibited, and obligated actions over a certain asset.

The ODRL Information Model formally defines the core abstract concepts of the model and their properties by means of an OWL 2 Ontology (available at https://www.w3.org/ns/odrl/2/), which is described in the ODRL Vocabulary & Expression specification.

The ODRL ontology can be used as a data model to represent machine-readable Policies and associate them with digital or analog assets. By using a machine-readable language to represent policies, ODRL implementations can provide useful functionalities such as those of a policy search engine, a policy compatibility checker, an access control system, a monitoring system, or a policy planning system, among others.

However, neither the specification of the model (in a text form) nor the vocabulary (in an OWL ontology) accurately describes the behaviour of an ODRL Evaluator. The objective of an ODRL Evaluator is to determine as output: This document describes the expected behaviour of an ODRL Evaluator, with a textual description and a collection of examples. This specification owes much to the previous description in the wiki.

When the ODRL Evaluator evaluates Permissions, it is expected to work in at least one of these two scenarios:

  1. Access control scenario: the ODRL Evaluator determines the access by users or software agents to digital resources considering a set of policies, the state of the world, and the description of the action that a user attempts to perform on certain digital resources.
  2. Policy monitoring scenario (or compliance checking): given a set of policies and the description of the state of the world that includes the performed actions, the ODRL Evaluator has to determine whether obligations or prohibitions have been fulfilled or violated by the performance of certain actions, and which permissions are active.

More precisely, the ODRL Evaluator uses as input:

The ODRL Evaluator requires a formal representation of the state of the world. This state of the world may include current date, current location of the agents, or the history of performed actions. This document does not formally specify how to represent the necessary entities (e.g. country codes). The formal representation of the world can be a set of RDF triples. The existence of these triples does not entail their represented world is a reality: the factuality of the class instances is not entailed, and hypothetical computations are possible. The implementor of the ODRL Evaluator may want to describe the factuality of relevant class instances. RDF triples to represent the state of the world may be generated as observations from the world generated by third parties (extrinsic), by the ODRL Evaluator user or by any other source (intrinsic).
For example it is crucial to represent in the state of the world:

The attempted actions are represented at least with their type, performer, and object.

Semantics of Policies

There are three ODRL Policy subclasses (Agreement, Offer, Set), plus four non-normative ODRL Policy subclasses (Assertion, Privacy, Request, Ticket). Direct instances of the odrl:Policy class must be understood as policy odrl:Set policies. This subsection describes how are these policies to be understood in relation to semantics.

Semantics of Permissions, Prohibitions, and Obligations

The deontic modalities of permissions, prohibitions and obligations can be represented in ODRL as instances of the classes odrl:Permission, odrl:Prohibition and odrl:Duty.

Instances of the class odrl:Duty may have the following different meanings in ODRL:

In addition to this:


The concepts (objects) to be understood by an ODRL Evaluator therefore include: Policy, Permission, Prohibition, Obligation, Condition (Duty), Consequence, Remedy, Refinement, Constraint, State of the World, and attempted action. Here follows a list of properties (with their possible values) needed by the ODRL Evaluator:

The mechanisms for computing the activation of Permissions, Prohibitions, and Obligations and the violation or fulfillment of Prohibitions and Obligations are all different. Therefore we continue by discussing the semantics of Permissions, Prohibitions, and Obligations in separated sections.

Semantics of Permissions

In ODRL 2.2 a Permission can be limited by duties, like making a payment, we call these Conditions. It can also be limited by Constraints (in time, in space, etc.). In addition, the definition of the permitted action, the asset, and the party collection can be refined with Refinements. The evaluation of these Conditions (duties), Constraints and Refinements determine whether the Permission is active or not. The evaluation of permission activation is different in the access control scenario that in the monitoring scenario.

In the access control scenario: when an action is attempted, the activation of permissions is computed. If there is an active permission that permits such an action, the action is performed, and the permission is used by such an action. If there is not an active permission that permits such an action, it is blocked. In the access control scenario, the value of the satisfaction state of a Refinement is computed according to the action that an agent attempts to perform on digital resources and is used to compute the activation of the permission.

In the monitoring scenario: when an action is performed (and it is represented in the state of the world), if there is no active permission to do so and the default setting for the ODRL Evaluator is set to "everything is prohibited unless explicitly permitted" a violation should be generated.
If the performed action belongs to class of actions regulated by an active permission AND the performed action satifies the Refinements, then the action is permitted and the permission is used by such an action.
In the monitoring scenario, the value of the satisfaction state of a Refinement is computed according to the actual actions that are performed by the agents and that are represented in the state of the world. The satisfaction of the Refinement is NOT used for computing the activation of the Permission.

Expected behaviour of the ODRL Evaluator

The ODRL Evaluator compute that a Permission is active if:

  1. all the existing Constraints of the Rule are satisfied and;
  2. all the existing Conditions (duties of the Rule) are fulfilled or inactive and;
  3. only for the access control scenario: all the existing Refinements of the Action, AssetCollection, PartyCollection are satisfied by the attempted action.

If the Permission is active, then the action is permitted.
If one of those conditions is not met, the Permission is inactive.

In the following examples of permissions, as we will analyse one permission at a time, we will not deal with the generation of violations for permissions.

Evaluation of Constraints and Refinements

Please note that in the following examples namespaces are used, so that http://example.com/constraint/ is simplified by "constraint:", http://example.com/policy/ is simplified by "policy:", etc.

Notation used in the example tables: blue colour for the input and red colour for the output of the ODRL Evaluator

Example of a constrained permission

Example description

A permission may have its action limited (in time, in space, etc.) without any Condition (Duty) or Refinement. This is the situation of the following case, similar to Example 13 in the ODRL Information Model 2.2. The permission below allows the target asset document:1234 to be distributed, it includes the constraint that the permission may only be exercised until 2018-01-01. The permission is granted by the organization party:16.

            {
            "@context": "http://www.w3.org/ns/odrl.jsonld",
            "@type": "Set",
            "uid": "http://example.com/policy/13",
            "permission": [{
               "target": "http://example.com/document/1234",
               "assigner": "http://example.com/party/16",
               "action": "distribute",
               "constraint": [{
                   "@id": "http://example.com/constraint/1",
                   "leftOperand": "dateTime",
                   "operator": "lt",
                   "rightOperand":  { "@value": "2018-01-01", "@type": "xsd:date" }
               }]
            }]
            }
            

Expected behaviour of the Evaluator

The ODRL Evaluator has to calculate first the activation state. The constraint must be evaluated on the state of the world, which must include a representation of the current time. As long as the current time is before the first day of 2018, the Permission is active. When the first day of 2018 is passed, the Permission is inactive.
The class of actions regulated by this Permission has type equal to distribute and object equal to the target of the permission, i.e. document:1234.

Access control scenario:

The table below shows the input (blue) and the output (red) of the ODRL Evaluator in the different cases.

Example Policy World Attempted Action satisfaction state of
constraint:1
access control
activation state of
permission
access control
control state
E13-1 policy:13 We are in 2017
current time.year=2017
distribute
document:1234
satisfied active permit the attempted action
E13-2 policy:13 We are in 2019
current time.year=2019
distribute
document:1234
not-satisfied inactive deny the attempted action

Monitoring scenario:

Example Policy World satisfaction state of
constraint:1
monitoring
activation state of
permission
monitoring
control state
E13-3 policy:13 We are in 2017 current time.year=2017 and
the action distribute of document:1234 was perfomed
satisfied active permit the attempted action
E13-4 policy:13 We are in 2019 current time.year=2018 and
the action distribute of document:1234 was perfomed
not-satisfied inactive deny the attempted action

Example of a permission whose permitted action is refined

Example description

The example below is similar to Example 14 in the ODRL Information Model 2.2. It allows the target asset document:1234 to be printed and also include a refinement indicating that the resolution of the printing action must be less than or equal to 1200 dpi. The permission is granted by the organization party:616.

        {
             "@context": "http://www.w3.org/ns/odrl.jsonld",
             "@type": "Set",
             "uid": "http://example.com/policy/14",
             "permission": [{
                "target": "http://example.com/document/1234",
                "assigner": "http://example.com/party/616",
                "action": [{
                   "rdf:value": { "@id": "odrl:print" },
                   "refinement": [{
                      "@id": "http://example.com/refinement/14"
                      "leftOperand": "resolution",
                      "operator": "lteq",
                      "rightOperand": { "@value": "1200", "@type": "xsd:integer" },
                      "unit": "http://dbpedia.org/resource/Dots_per_inch"
                    }]
                }]
              }]
        }
        

Expected behaviour of the Evaluator
The class of actions regulated by this Permission has type equal to print and its object is equal to the target of the permission, i.e. document:1234.

Access control scenario:

Example Policy Attempted Action satisfaction of
refinement:14
access control
activation of
permission
access control
control state
E14-1 policy:14 print of document:1234 with resolution less than 1200 dpi satisfied active permit the attempted action
E14-1 policy:14 print of document:1234 with resolution more than 1200 dpi not-satisfied inactive deny the attempted action

Monitoring scenario:

The Permission is always active because it has neither Constraints nor Conditions (Duties). Given a formal description a performed action.

Example Policy World satisfaction of
refinement:14
monitoring
activation of
permission
monitoring
control state
E14-3 policy:14 print of document:1234 with resolution less than 1200 dpi was performed satisfied active permit the performed action
E14-4 policy:14 print of document:1234 with resolution more than 1200 dpi was performed not-satisfied active deny the performed action

Evaluation of Conditions (Duties)

When a Permission contains Conditions (duties), they have to be evaluated first.

A Condition (duty) is fulfilled if all its constraints are satisfied and if its action, with all refinements satisfied, has been performed.

  1. The initial state of a Condition (duty) is inactive.
  2. If at least one of the Constraints of the Condition (duty) is not satisfied, then the duty is inactive. (For example, the duty to pay a ticket to get an active permission to enter in a museum may be active only on Sundays and inactive the other days).
  3. If the Constraints of the Condition (duty) are all satisfied or there are no Constraints, then the duty is active.
  4. If the Condition (duty) is active and its action with all refinements+properties satisfied is performed, then Condition (duty) is fulfilled by the performance of the action.

The life cycle of a Condition (duty) is depicted in the figure below:

Once the Condition (duty) has been evaluated, the Permission can be evaluated.
If the Condition is active but it is not fullfilled then the Permission is inactive.
If the Condition is fulfilled then the Permission is active.

Example of a conditioned permission

Example description

The example below (similar to Example 22 in the ODRL Information Model 2.2) is a Permission that is constrained by a Condition (Duty). The Condition does not have Constraints, but its action has a refinement. This permission is granted by party:sony for party:billie to play the target asset music:1999. The permission includes the Condition to perform the compensate action that has a refinement of payAmount of euro 5.00. The semantics of Permission requires that the compensate action (included in the duty) must be performed before the play action in order to get an active permission to perform the play action.

        {
        "@context": "http://www.w3.org/ns/odrl.jsonld",
        "@type": "Agreement",
        "uid": "http://example.com/policy/22",
        "permission": [{
            "assigner": "http://example.com/party/sony",
            "assignee": "http://example.com/party/billie",
            "target": "http://example.com/music/1999.mp3",
            "action": "play",
            "duty": [{
               "@id" : "http://example.com/condition/1",
               "action": [{
                  "rdf:value": { "@id": "odrl:compensate" },
                  "refinement": [{
                     "@id" : "http://example.com/refinement/1",
                     "leftOperand": "payAmount",
                     "operator": "eq",
                     "rightOperand": { "@value": "5.00", "@type": "xsd:decimal" },
                     "unit": "http://dbpedia.org/resource/Euro"
                  }]
                }]
            }]
        }]
        }  
        

Expected behaviour of the Evaluator

The class of actionss regulated by this Permission has type equal to play, object equal to the target of the permission, i.e. music:1999.mp3, and performer equal to the assignee of the permission, i.e. party:billie.

The condition (duty) have to be evaluated first. condition:1 does not have Constraints, so it is never inactive. It starts to be active and it is fulfilled when in the state of the world there is a representation of a performed action that matches with the the class of actions described in the condition:1.

The class of actionss regulated by condition:1 has type equal to compensate, its payAmount is equal to 5 euro, and (given that the odrl:compensatedParty of the odrl:compensate action is not specified) its beneficiary is the assigner of the permission party:sony. It is not required that the agent who performs the compensate action is party:billie because, for example, a company can pay for its employees (feature for an ODRL profile: it would be useful for actions of compensation or payment to contain a reference to a policy or a rule and to the party for whom they are performed).

Access control scenario:

Given a formal description of the attempted action, if such an action belongs to the class of actions regulated by the Permission and the Permission is active, then the action is performed, otherwise it is blocked.

Example Policy World Attempted Action activation state of
condition:1
deontic state of
condition:1
access control
activation state
of permission
access control
control state
E22-1 policy:22 compensate with payAmount = 5 euro
and beneficiary = party:sony is not performed
play and target = music:1999.mp3
and performer = party:billie
active not set inactive deny the attempted action
E22-2 policy:22 compensate and payAmount = 5 euro
and beneficiary = party:sony is performed
play and target = music:1999.mp3
and performer = party:billie
active fulfilled active permit the attempted action

Monitoring scenario:

Given a formal description a performed action. If such an action belongs to the class of actions regulated by the Permission and the Permission is active then the permission is used by the performed action.
Example Policy World activation of
condition:1
deontic state of
condition:1
monitoring
activation
permission
monitoring
control state
E22-3 policy:22 compensate with payAmount = 5 euro
and beneficiary = party:sony is not performed.
play with target = music:1999.mp3
and performer = party:billie is performed.
active not set inactive deny the performed action
E22-4 policy:22 compensate with payAmount = 5 euro
and beneficiary = party:sony is performed.
play with target = music:1999.mp3
and performer = party:billie is performed.
active fulfilled active permit the performed action

Example of a permission whose condition has constraints

Example description

This policy contains a Permission constrained by a Condition (duty) (like in policy:22) with the difference that such Condition has constraints, it is only activated on Sundays.

        {
        "@context": "http://www.w3.org/ns/odrl.jsonld",
        "@type": "Agreement",
        "uid": "http://example.com/policy/88",
        "permission": [{
            "assigner": "http://example.com/party/sony",
            "assignee": "http://example.com/party/billie",
            "target": "http://example.com/music/1999.mp3",
            "action": "play",
            "duty": [{
                "@id" : "http://example.com/condition/1",
                "action": [{
                    "@id" : "http://example.com/action/payment",
                    "rdf:value": { "@id": "odrl:compensate" },
                    "refinement": [{
                        "@id" : "http://example.com/refinement/1",
                        "leftOperand": "payAmount",
                        "operator": "eq",
                        "rightOperand": { "@value": "5.00", "@type": "xsd:decimal" },
                        "unit": "http://dbpedia.org/resource/Euro"
                    }]
                }],
                "constraint": [{
                    "@id" : "http://example.com/constraint/1",
                    "leftOperand": "dateTime",
                    "operator": "eq",
                    "rightOperand": { "@value": "Sunday", "@type": "xsd:string" }
                }]
            }]
        }]
        }  
        

Expected behaviour of the Evaluator

condition:1 has to be evaluated first. Given that condition:1 has constraints it starts to be inactive and it becomes active when its Constraints are all satisfied (the state of the world satisfies its Constraints, i.e. the current date is a Sunday). An active Constraint, it is also fulfilled when in the state of the world there is a representation of an performed action that matches with the class of actions described in the Constraint.

The permission can be evaluated as follows:
If the Condition is inactive (its Constraint is not satisfied), the Permission is active.
If the Condition is active but it is not fullfilled, the Permission is inactive.
If the Condition is fulfilled the Permission is active.

Access control and monitoring scenario:

The monitoring scenario and the access control scenario have the same evaluation when there is no refinement to be evaluated on the attempted or executed action that belongs to the class of actionss regulated by this Permission (its type is equal to play, its object is equal to the target of the permission, i.e. music:1999.mp3,and its performer is equal to the assignee of the permission, i.e. party:billie).

Example Policy World satisfaction of
constraint:1
satisfaction of
refinement:1
activation of
condition:1
deontic state of
condition:1

activation of
permission

control state
E88-1 policy:88 It is Saturday
not satisfied don't care inactive not set active permit the action
E88-2 policy:88 It is Sunday
compensate with payAmount = 5 euro
and beneficiary = party:sony is NOT performed.
satisfied not satisfied active not set inactive deny the action
E88-3 policy:88 It is Sunday
compensate with payAmount = 5 euro
and beneficiary = party:sony is performed.
satisfied satisfied active fulfilled active permit the action

Semantics of Prohibitions

In ODRL 2.2., a Rule that belongs to the odrl:Prohibition class is active (its action, with all refinements satisfied cannot be exercised) if all Constraints of the Rule are satisfied, otherwise it is inactive.
In order to evaluate if a prohibition is active, it is necessary to evaluate the satisfaction of its Constraints on the state of the world. Duties on prohibitions have no defined meaning.
An ODRL Evaluator will determine that a violation has been produced if the action regulated by an active prohibition is performed. If multiple actions are related to a single prohibition, the execution of a single action will result in a violation. The ODRL Evaluator will calculate the deontic state of an active prohibition to be within one of these possibilities: A prohibition may include an odrl:remedy for its violation.

Evaluation of a prohibition with constraints

Example description

This is example is similar to Example 19 in the Information Model, with the differences that it has not a related permission and it has a Constraint. In this case, there is a prohibition that is constrained by a constraint. The policy below is a formal Agreement between two parties (the assigner and the assignee) that the action of archiving the specified digital asset is prohibited. The prohibition is specifically active only during the year 2024.

        {
        "@context": "http://www.w3.org/ns/odrl.jsonld",
        "@type": "Agreement",
        "uid": "http://example.com/policy/55",
        "prohibition": [{
            "@id" : "http://example.com/prohibition/1",
            "target": "http://example.com/photoAlbum:55",
            "action": "archive",
            "assigner": "http://example.com/MyPix:55",
            "assignee": "http://example.com/assignee:55",
            "constraint": [{
               "@id" : "http://example.com/constraint/1",
               "leftOperand": "dateTime",
               "operator": "eq",
               "rightOperand":  { "@value": "2024", "@type": "xsd:gYear" }
           }]
        }]
        }
        

Expected behaviour of the Evaluator

The prohibition has an activation state and a deontic state that have to be calculated.

In this example, the Constraint must be evaluated on the state of the world. As long as the current time is in 2024, the Prohibition is active. Before or after 2024 the Prohibition is inactive. When the Prohibition is active, if the prohibited action is performed there is a violation.

Example Policy World satisfaction of
constraint:1
activation of
prohibition:1
monitoring
deontic state of
prohibition:1
E55-1 policy:55 in 2024 and archive of photoAlbum:55
by assignee:55 is performed
satisfied active violated by the performed action
E55-2 policy:55 in 2024 and archive of photoAlbum:55
by assignee:55 is NOT performed
satisfied active not set
E19-3 policy:55 in 2025 and archive of photoAlbum:55
by assignee:55 is performed
not satisfied inactive not set

Sematics of Obligations

In ODRL 2.2., an Obligation that belongs to the odrl:Duty class (it would be better to have an odrl:Obligation class) is active (its action, with all refinements satisfied, should be perfomed) if all constraints of the Rule are satisfied, otherwise it is inactive.
An active Obligation becomes: An obligation may include an odrl:consequence of not fulfilling that obligation.

Evaluation of an obligation without constraints

Example description

This example of derived from Example 20 in the Information Model. It describes an obligation that is not constrained by a Constraint. The policy below is a formal Agreement between two parties (the assigner and the assignee) that the action to compensate the assigner for a payment amount of EU500.00 is obliged.

        {
        "@context": "http://www.w3.org/ns/odrl.jsonld",
        "@type": "Agreement",
        "uid": "http://example.com/policy/42",
        "obligation": [{
          "@id" : "http://example.com/obligation/1",
          "assigner": "http://example.com/party/43",
          "assignee": "http://example.com/party/44",
          "action": [{
              "rdf:value": {
                "@id": "odrl:compensate"
              },
              "refinement": [
                {
                  "leftOperand": "payAmount",
                  "operator": "eq",
                  "rightOperand": { "@value": "500.00", "@type": "xsd:decimal" },
                  "unit": "http://dbpedia.org/resource/Euro"
                }]
            }]
        }]
        }
        

Expected behaviour of the Evaluator

The Evaluator must determine the activation state and the deontic state of the obligation. The Obligation is always active. If the obliged action is performed then the obligation is fulfilled.

Example Policy World activation of
obligation:1
monitoring
deontic state of
obligation:1
E42-1 policy:42 compensate of 500 euro by
party:44 to party:43 is performed
active fulfilled by the performed action
E42-2 policy:42 compensate of 500 euro by
party:44 to party:43 is NOT performed
active not set

Previous efforts

Section authored by Víctor. This section does not pretend to be part of a spec, but may serve as reference

Documents on "formal semantics" in W3C specifications

The W3C has produced several "Semantics" documents each of them with a different objective.

The RDF1.1. Semantics defines a model-theoretic semantics to determine the validity of RDF inference processes. A similar approach is followed by the OWL Semantics, a recommendation providing the direct model-theoretic semantics for OWL 2 and definingthe most common inference problems.

XPath (XML Path Language) is a language that can be used to navigate through elements and attributes in an XML document, and it also has formal semantics. XQuery (XML Query) is a query and functional programming language to query XML data. The "XQuery and XPath Formal Semantics" intends to complement the specification by defining the meaning of XQuery/XPath expressions with mathematical rigor; thus clarifying the intended meaning of the English specification, and ensuring that no corner cases are left out. For that regard grammar productions are given.

The POWDER specification provides a mechanism to describe and discover Web resources, and it also includes a Formal Semantics document. POWDER documents are XML documents which can be automatically converted, through a GRDDL transform, into a semantically rich version in RDF (POWDER-S). The "semantics" document describes how to make such transformation.

The PROV Ontology Working Group has produced 12 specifications to facilitate the interchange of provenance information in the Web (where provenance is …information about entities, activities, and people involved in producing a piece of data or thing, which can be used to form assessments about its quality, reliability or trustworthiness"). Besides having published a PROVO Ontology to facilitate the expression of provenance as RDF, the family of documents also define an EBNF notation "which allows serializations of PROV instances to be created in a compact manner", a set of constraints to "ensure that a PROV instance represents a consistent history of objects and their interactions that is safe to use for the purpose of logical reasoning" and statements in the PROV Data Model are seen "as atomic formulas in the sense of first-order logic […and…] the constraints and inferences specified in PROV-CONSTRAINTS as a first-order theory".

ODRL Formalization

ODRL was created in in the early 2000's as an XML dialect to represent rights expressions to be used in the framework of Digital Rights Management systems; and its version 1.1 gained much spread [ODRL02]. Different ODRL profiles extended the vocabulary to satisfy the needs in different sectors. In 2011, an ODRL W3C Community Group was established, publishing soon after a new version 2.1 with major changes which included a new information model [Ianella15], a vocabulary [Ianella15b] and an Ontology [McRoberts15]. ODRL 2.1 became then a policy language.Other specifications in XML and similar to ODRL were MPEG-21 Rights Expression Language [Wang94], XACML or MPEG-21 Contracts Expression Language [Rodríguez15]. The MPEG-21 Media Contracts Ontology [Rodriguez16] defines an ontology to guide the generation of contracts as RDF, with a similar philosophy to that of the ODRL Ontology.

RDF documents instantiating the "Policy" class of the ODRL Ontology or using the XML or JSON syntaxes are called simply "ODRL Policies". The ODRL Ontology is already a formalization of the ODRL information model and vocabulary. The ontology of the version 2.1 consists of 1111 axioms with low complexity, but a comprehensive definition of each element (classes and relations) and a systematic definition of domains and ranges for the properties. Some ODRL concepts are represented as SKOS concepts ordered in SKOS collection. Reasoning with the ontology would be computationally inexpensive, but the usefulness of the possible reasoning tasks with the ontology is very limited.

The ODRL 2.1 Ontology is not the first ODRL Ontology and other ontologies had been proposed before [García05][Kasten10]. However, neither these ontologies nor the ODRL 2.1 Ontology directly supported any reasoning tasks of practical use. Other more generic rights ontologiesexist, claiming tocomprise the concepts of ODRL, with the ambition of facilitating interoperability. Thus, Delgado (2003) and Nadah (2007) have proposed ontologies as a bridge to make transformation between rights expression languages like ODRL and MPEG-21 REL, whereas Rodríguez (2013) underlined the similarities of seven policy languages with an ontology design pattern. Other alternative means of achieving interoperability do not require ontologies, as Guth did (2003) defining an abstract object model.

Some other formalizations of ODRL have been proposed with the purpose of determining whether a request is permitted given a set of policies and a certain history of events:we can name this task as theauthorisation decision.With that purpose, Gunter and Pucella had defined general logics for rights (2001 and 2002 respectively). Pucella then extended his work to model ODRL1.1 statements (2004) as formulas in a many-sorted first-order logic with equality,to determinewhether a permission was implied by a set of ODRL statements. Holzer et al. (2004) also enriched the authorisation decision modelling the dynamic aspects of licenses with finite-automata like structures (useful when the property of an asset is transferred, or when the number of plays is limited to a certain number of times). Chong et al. (2006) modelled licenses with multiset rewritingand logic programming (Prolog), including the ability to evaluate and merge licenses and to track the dynamic aspects of the rights evolution. Barth and Mitchell (2006) observed that the authorisation decision of a sequence of actions given a set of ODRL licenses is NP-complete because of the interval constraints, and proposed using propositional linear logic to grant efficient computability. Sheppard and Sfavi(2009) defined an algorithm for the authorisation decision with some of the most common ODRL elements, giving the pseudo-code for a virtual machine. Steyskal and Polleres (2015) defined an abstract syntax for expressing ODRL policies, where the dependencies among ODRL actions and the different conflict resolution strategies were explicitly considered in the rules for taking the authorisation decision.

Besides the problems of facilitating interoperability and making the authorisation decision, other problems of interest have been modeled with formalizations of ODRL. One of them is how to evaluate the compatibility and composition of licenses, useful when handling with differently licensed content or data. In this line, Gangadharan et al. (2007)proposed a matchmaking algorithm to analyze the compatibility of licenses and make license compositions; Jamkhedkarand Heileman (2008) showed how the combination of ODRL, CreativeCommons REL and the XrML (embryo of the MPEG-21 REL) licenses was possible with an abstract model and several rules. Villata and Gandon (2012) also defined a framework with algorithms to validate compatibility and to obtain composite licenses. Rotolo et al. (2013) defined a deontic logic system for the composition of licenses, with strict rules, defasible rules and defeater rules. More recent critics

It is evident that some policies can be used to grant automated access to resources. For example, verifying the execution of a payment can be automatically done. However, the satisfaction of some constraints cannot be digitally evaluated. Policies then play a double role, as automatable expressions in a computer system and as constracts with a certain legal value. Steyskal and Kirrane (2015) show how to use ODRL to specify access requests, data offers and agreements, distinguishing between enforceable and non-enforceable access policies, proposing an algorithm to auto-generate contracts for the latter.

In more recent efforts, de Vos et al. (2019) transforms ODRL expressions into Answer Set Programming to model policies and check compliance – specifically in the area of personal data processing, where ODRL has also been recently used (Esteves et al. 2021). Other profiles and initiatives have been proposed (Kim et al. 2020), on despite of several limitations found by Kebede at al. (2020).

In Fornara and Colombetti (2019) the ODRL 2.2 policy language has been extended in two directions. Firstly, by inserting in the model the notion of activation event, secondly, by considering the temporal aspects of obligations, permissions, and prohibitions (e.g. expiration dates and deadlines) as part of the application independent model of policies.

References

[Wieringa93] Wieringa, R. J., & Meyer, J. J. C. (1993). Applications of deontic logic in computer science: A concise overview. Deontic logic in computer science, pp. 17-40 John Wiley & Sons.
[Gunter01] Gunter, C. A., Weeks, S. T., & Wright, A. K. (2001, January). Models and languages for digital rights. In System Sciences, 2001. Proceedings of the 34th Annual Hawaii International Conference on (pp. 5-pp). IEEE.
[ODRL02] Ianella, R. Open Digital Rights Language (ODRL) Version 1.1. Formerly available online.
[Pucella02] Pucella, R., &Weissman, V. (2002). A logic for reasoning about digital rights. In Computer Security Foundations Workshop, 2002. Proceedings. 15th IEEE (pp. 282-294). IEEE.
[XACML03] Anderson, A., Nadalin, A., Parducci, B., Engovatov, D., Lockhart, H., Kudo, M., ... & Moses, T. (2003). extensible access control markup language (xacml) version 1.0. OASIS.
[Delgado03] Delgado, J., Gallego, I., Llorente, S., & García, R. (2003, December). IPROnto: An ontology for digital rights management. In 16th Annual Conference on Legal Knowledge and Information Systems, JURIX (Vol. 106).
[Guth03] Guth, S., Neumann, G., &Strembeck, M. (2003, October). Experiences with the enforcement of access rights extracted from ODRL-based digital contracts. In Proceedings of the 3rd ACM workshop on Digital rights management (pp. 90-102). ACM.
[Pucella04] RiccardoPucella , Vicky Weissman. A formal foundation for ODRL, In Proc. of the Workshop on Issues in the Theory of Security (WIST’04)
[Wang04] Wang, X. (2004). MPEG-21 rights expression language: Enabling interoperable digital rights management. IEEE MultiMedia, 11(4), 84-87.
[García05] García, R., Gil, R., Gallego, I., & Delgado, J. (2005, July). Formalising ODRL semantics using web ontologies. In Proc. 2nd Intl. ODRL Workshop (pp. 1-10).
[Barth06] Adam Barth and John C. Mitchell. Managing digital rights using linear logic. In LICS ’06: Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science, pages 127–136,Washington, DC, USA, 2006. IEEE Computer Society
[Chong06] Chong, C. N., Corin, R., Doumen, J., Etalle, S., Hartel, P., Law, Y. W., &Tokmakoff, A. (2006). LicenseScript: a logical language for digital rights management. Annals of Telecommunications, 61(3), 284-331.
[Nadah07] Nadia Nadah, Melanie Dulong de Rosnay, Bruno Bachimont. Licensing Digital Content With A Generic Ontology: Escaping From The Rights Expression Language Jungle. ACM. ICAIL2007 - 11th international conference on Articial intelligence and law, Jun 2007, Stanford, United States. pp.65-69, 2007, Proceedings of the 11th international conference on Articial intelligence and law
[Gangadharan07] Gangadharan G.R., Weiss M., D’Andrea V., Iannella R. (2007) Service License Composition and Compatibility Analysis. In: Krämer B.J., Lin KJ., Narasimhan P. (eds) Service-Oriented Computing – ICSOC 2007. ICSOC 2007. Lecture Notes in Computer Science, vol 4749. Springer, Berlin, Heidelberg
[Jamkhedkar08] Pramod Arvind Jamkhedkar, Gregory L. Heileman. Conceptual Model For Rights. Proceedings of the 8th ACM workshop on Digital rights management Pages 29-38, 2008
[Sheppard09] Sheppard, N. P., &Safavi-Naini, R. (2009, November). On the operational semantics of rights expression languages. In Proceedings of the nineth ACM workshop on Digital rights management (pp. 17-28). ACM.
[Kasten10] Andreas Kasten and Rüdiger Grimm. Making the Semantics of ODRL and URM Explicit Using Web Ontologies. Virtual Goods, pages 77–91, 2010.
[Villata12] Serena Villata and FabienGandon. Licenses compatibilityand composition in the web of data. In The 2ndInternational Workshop on Consuming Linked Data.2012.
[Rodriguez13] Rodríguez-Doncel, V., Suárez-Figueroa, M. C., Gómez-Pérez, A., & Poveda-Villalón, M. (2013, October). License linked data resources pattern. In Proceedings of the 4th International Conference on Ontology and Semantic Web Patterns-Volume 1188 (pp. 84-87). CEUR-WS. org.
[Rotolo13] Antonino Rotolo, Serena Villata, and Fabien Gandon. A deontic logic semantics for licenses composition in the web of data. In Int’l Conf. on Artificial Intelligence and Law ICAIL, pages 111–120, 2013.
[Steyskal14] Simon Steyskal and Axel Polleres. Defining expressive access policies for linked data using the ODRL ontology 2.0. In Proceedings of the 10th International Conference on Semantic Systems, SEMANTICS 2014, Leipzig, Germany, September 4-5, 2014, pages 20–23, 2014
[Cabrio14] Elena Cabrio, Alessio Palmero Aprosio, and Serena Villata. These are your rights - A natural language processing approach to automated RDF licenses generation. In The Semantic Web: Trends and Challenges - 11th International Conference, ESWC 2014, Anissaras, Crete, Greece, May 25-29, 2014. Proceedings, pages 255– 269, 2014
[Ianella15b] R. Iannella, M. Steidl, S. Guth (eds). Open Digital Rights Language (ODRL) Version 2.1 – Common Vocabulary. Final Specification, W3C ODRL Community Group http://www.w3.org/community/odrl/vocab/2.1/
[Ianella15] R. Iannella& S. Guth& D. Paehler& A. Kasten (eds). Open Digital Rights Language (ODRL) Version 2.1 – Core Model. Final Specification, W3C ODRL Community Group. http://www.w3.org/community/odrl/model/2.1/
[McRoberts15] M. McRoberts, V. Rodríguez Doncel. Open Digital Rights Language (ODRL) Version 2.1 – Ontology. Final Specification, W3C ODRL Community Group http://www.w3.org/ns/odrl/2/
[Rodriguez15] Rodríguez, E., Delgado, J., Boch, L., & Rodríguez-Doncel, V. (2015). Media Contract Formalization Using a Standardized Contract Expression Language. IEEE multimedia, 22(2), 64-74.
[Steyskal15] Steyskal, S., &Kirrane, S. (2015). If you can't enforce it, contract it: Enforceability in Policy-Driven (Linked) Data Markets. In SEMANTiCS (Posters & Demos) (pp. 63-66).
[Steyskal15b] Steyskal, S., &Polleres, A. (2015, August). Towards formal semantics for ODRL policies. In International Symposium on Rules and Rule Markup Languages for the Semantic Web (pp. 360-375). Springer International Publishing.
[Rodriguez16] Rodríguez-Doncel, V., Delgado, J., Llorente, S., Rodríguez, E., & Boch, L. (2016). Overview of the MPEG-21 Media Contract Ontology. Semantic Web, 7(3), 311-332.
[DeVos19] De Vos, M., Kirrane, S., Padget, J., & Satoh, K. (2019, September). ODRL policy modelling and compliance checking. In International Joint Conference on Rules and Reasoning (pp. 36-51). Springer, Cham.
[Kebede20] Kebede, M. G., Sileno, G., & van Engers, T. (2020). A critical reflection on ODRL. Springer Lecture Notes Artificial Intelligence, AICOL2021, to appear.
[Kim20] Kim, J. M., & Chung, H. S. (2020). ODRL Ontology Extention Model and Prototype Design for the Specification of the Rights to use Digital Contents. Journal of Convergence for Information Technology, 10(1), 13-21.
[Esteves21] Esteves, B., Pandit, H. J., & Rodrıguez-Doncel, V. ODRL Profile for Expressing Consent through Granular Access Control Policies in Solid. To appear, proc. of the Workshop on Consent Management in Online Services, Networks and Things (COnSeNT) - co-located with IEEE European Symposium on Security and Privacy (EuroS&P 2021)
[Fornara19] N. Fornara and M. Colombetti. Using Semantic Web Technologies and Production Rules for Reasoning on Obligations, Permissions, and Prohibitions. AI Communications, vol. 32, no. 4, pp. 319-334, 2019.

Document Conventions

Prefix Namespace Description
odrl http://www.w3.org/ns/odrl/2/ [[odrl-vocab]] [[odrl-model]]
rdf http://www.w3.org/1999/02/22-rdf-syntax-ns# [[rdf11-concepts]]
rdfs http://www.w3.org/2000/01/rdf-schema# [[rdf-schema]]
owl http://www.w3.org/2002/07/owl# [[owl2-overview]]
xsd http://www.w3.org/2001/XMLSchema# [[xmlschema11-2]]
skos http://www.w3.org/2004/02/skos/core# [[skos-reference]]
dcterms http://purl.org/dc/terms/ [[dcterms]]
vcard http://www.w3.org/2006/vcard/ns# [[vcard-rdf]]
foaf http://xmlns.com/foaf/0.1/ [[foaf]]
schema http://schema.org/ schema.org
cc https://creativecommons.org/ns# creativecommons.org
ex http://example.com/ns#