Denotational Semantics for ODRL: Knowledge-Based Constraint Conflict Detection

• URL: http://arxiv.org/abs/2602.19883v1
• Date: Mon, 23 Feb 2026 14:28:13 GMT
• Title: Denotational Semantics for ODRL: Knowledge-Based Constraint Conflict Detection
• Abstract summary: We present a denotational semantics that maps each ODRL constraint to the set of knowledge-base concepts satisfying it.<n>For cross-dataspace interoperability, we define order-preserving alignments between knowledge bases.<n>A runtime soundness theorem ensures that design-time verdicts hold for all execution contexts.
• Score: 1.061268230310221
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: ODRL's six set-based operators -- isA, isPartOf, hasPart, isAnyOf, isAllOf, isNoneOf -- depend on external domain knowledge that the W3C specification leaves unspecified. Without it, every cross-dataspace policy comparison defaults to Unknown. We present a denotational semantics that maps each ODRL constraint to the set of knowledge-base concepts satisfying it. Conflict detection reduces to denotation intersection under a three-valued verdict -- Conflict, Compatible, or Unknown -- that is sound under incomplete knowledge. The framework covers all three ODRL composition modes (and, or, xone) and all three semantic domains arising in practice: taxonomic (class subsumption), mereological (part-whole containment), and nominal (identity). For cross-dataspace interoperability, we define order-preserving alignments between knowledge bases and prove two guarantees: conflicts are preserved across different KB standards, and unmapped concepts degrade gracefully to Unknown -- never to false conflicts. A runtime soundness theorem ensures that design-time verdicts hold for all execution contexts. The encoding stays within the decidable EPR fragment of first-order logic. We validate it with 154 benchmarks across six knowledge base families (GeoNames, ISO 3166, W3C DPV, a GDPR-derived taxonomy, BCP 47, and ISO 639-3) and four structural KBs targeting adversarial edge cases. Both the Vampire theorem prover and the Z3 SMT solver agree on all 154 verdicts. A key finding is that exclusive composition (xone) requires strictly stronger KB axioms than conjunction or disjunction: open-world semantics blocks exclusivity even when positive evidence appears to satisfy exactly one branch.

Related papers

• SeGDeP: Semantic- and Geometric-Aware Decoupled Prompts for Reasoning Segmentation [51.46828526392219]
  Reasoning segmentation converts an implicit linguistic conclusion into a precise mask.<n>Existing MLLM-segmenter interfaces either use a special trigger or compress both signals into one context.<n>We present SeGDeP, an explicit what-where interface.
  arXiv  Detail & Related papers  (2026-09-08T15:11:32Z)
• Runtime Observability for Heterogeneous Attention Memory [20.158719055939383]
  We give a runtime observability contract that covers all four memory classes with three operators.<n>We compose the per-stage stack into an executable request-level risk ledger.
  arXiv  Detail & Related papers  (2026-08-06T10:41:50Z)
• PerceptionRubrics: Calibrating Multimodal Evaluation to Human Perception [75.70273182182397]
  PerceptionRubrics is a rubric-based evaluation framework.<n>It addresses the gap between saturated benchmark scores and real-world brittleness.<n>It pairs 1,038 information-dense images with over 10,000 instance-specific rubrics.
  arXiv  Detail & Related papers  (2026-06-26T17:59:15Z)
• R-APS: Compositional Reasoning and In-Context Meta-Learning for Constrained Design via Reflective Adversarial Pareto Search [18.8323743697237]
  Large language models (LLMs) are fluent on open-ended tasks, yet in agentic settings, fluency does not ensure reliable delivery.<n>We trace this gap to three coupled structural failures: errors propagate without localization, worst-case perturbations go unevaluated, and accumulated knowledge is never invalidated.<n>We argue these share a root cause: abductive, counterfactual, meta-inductive, corrective, and inductive reasoning pull a shared context in incompatible directions.
  arXiv  Detail & Related papers  (2026-06-03T12:45:39Z)
• TRUST: A Framework for Decentralized AI Service v.0.1 [47.384270414446604]
  Large Reasoning Models (LRMs) and Multi-Agent Systems (MAS) in high-stakes domains demand reliable verification.<n>We introduce TRUST (Transparent, Robust, and Unified Services for Trustworthy AI), a decentralized framework with three innovations.<n>We prove a Safety-Profitability Theorem ensuring honest auditors profit while malicious actors incur losses.
  arXiv  Detail & Related papers  (2026-04-29T19:32:58Z)
• Topological Void Analysis A Mathematical Framework for Systematic Technical Innovation Discovery in Knowledge Spaces [0.0]
  We present Topological Void Analysis (TVA), a mathematical framework that defines topological voids as triads in a dense-sparse hybrid embedding space.<n>TVA generates 2,128 invention candidates across 96 targets; 90% survive automated quality filtering, yielding 191 REVISE and 1 APPROVE verdict from four-specialist adversarial review.
  arXiv  Detail & Related papers  (2026-04-20T06:41:39Z)
• PRECEPT: Planning Resilience via Experience, Context Engineering & Probing Trajectories A Unified Framework for Test-Time Adaptation with Compositional Rule Learning and Pareto-Guided Prompt Evolution [2.28438857884398]
  LLM agents that store knowledge as natural language suffer steep retrieval degradation as condition count grows.<n>We introduce PRECEPT, a unified framework for test-time adaptation with three tightly coupled components.
  arXiv  Detail & Related papers  (2026-03-10T13:16:45Z)
• CIRCUS: Circuit Consensus under Uncertainty via Stability Ensembles [1.3011345529764784]
  We show that CIRCUS produces a threshold-robust "core" circuit while explicitly surfacing contingent alternatives.<n>On Gemma-2-2B and Llama-3.2-1B, strict consensus circuits are 40x smaller than the union of constructs all configurations while retaining comparable influence-flow explanatory power.<n>We further validate causal relevance with activation patching, where consensus-identified nodes consistently beat matched non-consensus controls.
  arXiv  Detail & Related papers  (2026-02-28T07:44:04Z)
• Axis Decomposition for ODRL: Resolving Dimensional Ambiguity in Policy Constraints through Interval Semantics [1.061268230310221]
  Five of ODRL's approximately 34 left operands denote multi-dimensional quantities.<n>A single scalar constraint admits one interpretation per axis, making policy evaluation non-deterministic.<n>We classify ODRL's left operands by value-domain structure (scalar, dimensional, concept-valued), grounded in the ODRL 2.2 specification text.
  arXiv  Detail & Related papers  (2026-02-23T14:24:46Z)
• BEDA: Belief Estimation as Probabilistic Constraints for Performing Strategic Dialogue Acts [69.7477004390211]
  We formalize two core acts Adversarial and Alignment, and operationalize them via probabilistic constraints on what an agent may generate.<n>We instantiate this idea in BEDA, a framework that consists of the world set, the belief estimator for belief estimation, and the conditional generator that selects acts and realizes utterances consistent with the inferred beliefs.
  arXiv  Detail & Related papers  (2025-12-31T14:26:55Z)
• Non-Resolution Reasoning (NRR): A Computational Framework for Contextual Identity and Ambiguity Preservation [0.0]
  Current artificial intelligence systems exhibit a fundamental architectural limitation: they resolve ambiguity prematurely.<n>This premature semantic collapse stems from classical identity assumptions embedded in standard neural architectures.<n>We propose Non-Resolution Reasoning (NRR), a computational framework that treats ambiguity retention as a valid reasoning mode.
  arXiv  Detail & Related papers  (2025-12-15T16:14:32Z)
• BRIDGE: Building Representations In Domain Guided Program Verification [67.36686119518441]
  BRIDGE decomposes verification into three interconnected domains: Code, Specifications, and Proofs.<n>We show that this approach substantially improves both accuracy and efficiency beyond standard error feedback methods.
  arXiv  Detail & Related papers  (2025-11-26T06:39:19Z)
• A Multi-dimensional Semantic Surprise Framework Based on Low-Entropy Semantic Manifolds for Fine-Grained Out-of-Distribution Detection [9.10958906714455]
  We formalize the core task as quantifying the Semantic Surprise of a new sample.<n>We then introduce the Semantic Surprise Vector (SSV), a universal probe that decomposes a sample's total surprise into three complementary dimensions: conformity, novelty, and ambiguity.<n> Experiments demonstrate that our framework not only establishes a new state-of-the-art (sota) on the challenging ternary task, but its robust representations also achieve top results on conventional binary benchmarks.
  arXiv  Detail & Related papers  (2025-10-15T02:26:35Z)
• CAR: Conceptualization-Augmented Reasoner for Zero-Shot Commonsense Question Answering [56.592385613002584]
  We propose Conceptualization-Augmented Reasoner (CAR) to tackle the task of zero-shot commonsense question answering. CAR abstracts a commonsense knowledge triple to many higher-level instances, which increases the coverage of CommonSense Knowledge Bases. CAR more robustly generalizes to answering questions about zero-shot commonsense scenarios than existing methods.
  arXiv  Detail & Related papers  (2023-05-24T08:21:31Z)
• Relational Proxies: Emergent Relationships as Fine-Grained Discriminators [52.17542855760418]
  We propose a novel approach that leverages information between the global and local part of an object for encoding its label. We design Proxies based on our theoretical findings and evaluate it on seven challenging fine-grained benchmark datasets. We also experimentally validate our theory and obtain consistent results across multiple benchmarks.
  arXiv  Detail & Related papers  (2022-10-05T11:08:04Z)
• Supervised Semantic Similarity-based Conflict Detection Algorithm: S3CDA [0.8249694498830561]
  We introduce S3CDA, a two-phase algorithm designed to automatically detect conflicts in software requirements.<n>Our method first identifies potentially conflicting requirement pairs using semantic similarity.<n>We compare it against popular large language models like GPT-4o, Llama-3, Sonnet-3.5 and Gemini-1.5.
  arXiv  Detail & Related papers  (2022-06-28T01:48:12Z)
• Simultaneous Semantic Alignment Network for Heterogeneous Domain Adaptation [67.37606333193357]
  We propose aSimultaneous Semantic Alignment Network (SSAN) to simultaneously exploit correlations among categories and align the centroids for each category across domains. By leveraging target pseudo-labels, a robust triplet-centroid alignment mechanism is explicitly applied to align feature representations for each category. Experiments on various HDA tasks across text-to-image, image-to-image and text-to-text successfully validate the superiority of our SSAN against state-of-the-art HDA methods.
  arXiv  Detail & Related papers  (2020-08-04T16:20:37Z)
• BoxE: A Box Embedding Model for Knowledge Base Completion [53.57588201197374]
  Knowledge base completion (KBC) aims to automatically infer missing facts by exploiting information already present in a knowledge base (KB) Existing embedding models are subject to at least one of the following limitations. BoxE embeds entities as points, and relations as a set of hyper-rectangles (or boxes)
  arXiv  Detail & Related papers  (2020-07-13T09:40:49Z)

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.