A Formally Grounded ODRL Evaluator: Implementation and Comparison

• URL: http://arxiv.org/abs/2607.15987v1
• Date: Fri, 17 Jul 2026 14:24:06 GMT
• Title: A Formally Grounded ODRL Evaluator: Implementation and Comparison
• Abstract summary: We present the first ODRL Evaluator with transparent formal semantics and supporting all rule types.<n>We experimentally measure its performance, analysing different scalability dimensions related to policy complexity and size of the data on which a policy is evaluated.
• Score: 0.06524460254566902
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The ODRL policy language is emerging as the de-facto standard for policy modelling data access and usage preferences, AI governance policies and data workflows in European dataspaces. The current standard has no mathematical formal semantics to describe how a system should implement policy evaluation. This has resulted in a variety of systems and tools that implement their own interpretation of the language, which limits interoperability and cannot guarantee consistent results. Based on an existing semantic model of ODRL, we formalise the problems of ODRL evaluation for the access control and monitoring scenarios, in both static and streaming settings, and we provide a novel, efficient algorithm and implementation. We present the first ODRL Evaluator with transparent formal semantics and supporting all rule types. We experimentally measure its performance, analysing different scalability dimensions related to policy complexity and size of the data on which a policy is evaluated. We compare our system with the state-of-the-art by providing a comparative review of existing ODRL evaluators, which highlights the differences in supported ODRL features and evaluation modes.

Related papers

• An Instrument to Evaluate Governance Proposals: AI Policy Analysis at Scale [4.570330752352129]
  This paper introduces a policy analysis framework for AI governance proposals in an evolving and contested regulatory landscape.<n>We use a mixed-methods approach that integrates qualitative insights from subject matter experts with computational text analysis to inform the design of policy attribute rubrics.<n>Rather than assessing policy effectiveness or desirability, the framework focuses on relevance and alignment across attributes.
  arXiv  Detail & Related papers  (2026-07-30T12:06:53Z)
• UniDial-EvalKit: A Unified Toolkit for Evaluating Multi-Faceted Conversational Abilities [70.79422099851506]
  We present UniDial-EvalKit (UDE), a unified evaluation toolkit for assessing interactive AI systems.<n>UDE standardizes heterogeneous data formats into a universal schema, streamlines complex evaluation pipelines through a modular architecture, and aligns metric calculations under a consistent scoring interface.
  arXiv  Detail & Related papers  (2026-03-24T13:01:31Z)
• ODRL Policy Comparison Through Normalisation [0.07646713951724009]
  The ODRL language has become the standard for representing policies and regulations for digital rights.<n>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.<n>We tackle these problems by proposing an approach that involves a parametrised normalisation of ODRL policies into its minimal components.
  arXiv  Detail & Related papers  (2026-03-13T12:09:22Z)
• Parajudica: An RDF-Based Reasoner and Metamodel for Multi-Framework Context-Dependent Data Compliance Assessments [0.0]
  Parajudica is an open, modular, and RDF/SPARQL-based rule system for evaluating context-dependent data compliance status.<n>We demonstrate the utility of this resource and accompanying metamodel through application to existing legal frameworks and industry standards.
  arXiv  Detail & Related papers  (2025-12-05T06:16:34Z)
• Evaluation and Comparison Semantics for ODRL [0.12314765641075437]
  We consider the problem of evaluating, and comparing computational policies in the Open Digital Rights Language (ODRL)<n>We provide a simple and intuitive formal semantics for ODRL that is based on query answering.
  arXiv  Detail & Related papers  (2025-09-05T14:30:41Z)
• SEOE: A Scalable and Reliable Semantic Evaluation Framework for Open Domain Event Detection [70.23196257213829]
  We propose a scalable and reliable Semantic-level Evaluation framework for Open domain Event detection.<n>Our proposed framework first constructs a scalable evaluation benchmark that currently includes 564 event types covering 7 major domains.<n>We then leverage large language models (LLMs) as automatic evaluation agents to compute a semantic F1-score, incorporating fine-grained definitions of semantically similar labels.
  arXiv  Detail & Related papers  (2025-03-05T09:37:05Z)
• Open Digital Rights Enforcement Framework (ODRE): from descriptive to enforceable policies [1.3927943269211591]
  This paper introduces the Open Digital Rights Enforcement (ODRE) framework, whose goal is to provide ODRL with enforcement capabilities. The framework includes an enforcement algorithm for ODRL policies and two open-source implementations in Python and Java.
  arXiv  Detail & Related papers  (2024-09-26T07:36:49Z)
• Optimal Baseline Corrections for Off-Policy Contextual Bandits [61.740094604552475]
  We aim to learn decision policies that optimize an unbiased offline estimate of an online reward metric. We propose a single framework built on their equivalence in learning scenarios. Our framework enables us to characterize the variance-optimal unbiased estimator and provide a closed-form solution for it.
  arXiv  Detail & Related papers  (2024-05-09T12:52:22Z)
• Statistically Efficient Variance Reduction with Double Policy Estimation for Off-Policy Evaluation in Sequence-Modeled Reinforcement Learning [53.97273491846883]
  We propose DPE: an RL algorithm that blends offline sequence modeling and offline reinforcement learning with Double Policy Estimation. We validate our method in multiple tasks of OpenAI Gym with D4RL benchmarks.
  arXiv  Detail & Related papers  (2023-08-28T20:46:07Z)
• Counterfactual Learning with General Data-generating Policies [3.441021278275805]
  We develop an OPE method for a class of full support and deficient support logging policies in contextual-bandit settings. We prove that our method's prediction converges in probability to the true performance of a counterfactual policy as the sample size increases.
  arXiv  Detail & Related papers  (2022-12-04T21:07:46Z)
• Mutual Information Regularized Offline Reinforcement Learning [76.05299071490913]
  We propose a novel MISA framework to approach offline RL from the perspective of Mutual Information between States and Actions in the dataset. We show that optimizing this lower bound is equivalent to maximizing the likelihood of a one-step improved policy on the offline dataset. We introduce 3 different variants of MISA, and empirically demonstrate that tighter mutual information lower bound gives better offline RL performance.
  arXiv  Detail & Related papers  (2022-10-14T03:22:43Z)
• Supervised Off-Policy Ranking [145.3039527243585]
  Off-policy evaluation (OPE) leverages data generated by other policies to evaluate a target policy. We propose supervised off-policy ranking that learns a policy scoring model by correctly ranking training policies with known performance. Our method outperforms strong baseline OPE methods in terms of both rank correlation and performance gap between the truly best and the best of the ranked top three policies.
  arXiv  Detail & Related papers  (2021-07-03T07:01:23Z)
• Benchmarks for Deep Off-Policy Evaluation [152.28569758144022]
  We present a collection of policies that can be used for benchmarking off-policy evaluation. The goal of our benchmark is to provide a standardized measure of progress that is motivated from a set of principles. We provide open-source access to our data and code to foster future research in this area.
  arXiv  Detail & Related papers  (2021-03-30T18:09:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.