Sort-Stratified Semantics for Temporal Conflict Detection in ODRL Policies
Abstract: In the Open Digital Rights Language (ODRL), temporal constraints range over two sorts, instants and durations, but the comparison operators do not distinguish them. The same operator thus means "earlier instant" or "shorter duration," leaving conflict detection between two policies unsound. We resolve this by sort stratification: each temporal operand is typed to one of two ordered domains, points in time or amounts of time. Each constraint then denotes an interval, and conflict reduces to interval comparison under a three-valued verdict (Conflict, Compatible, Unknown). We characterise the check's decidability across a static and a runtime fragment, prove it sound, and evaluate it on a benchmark of policy problems compiled to TPTP and SMT-LIB, available as an artefact.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.