arxiv: 2604.16386 · v1 · submitted 2026-03-27 · 💻 cs.DB · cs.AI· cs.CY

Recognition: 1 theorem link

· Lean Theorem

DAOnt: A Formal Ontology for EU Data Act Compliance

Sheyla Leyva-S\'anchez , Fabian Linde , Meem Arafat Manab , Mar\'ia Poveda-Villal\'on , V\'ictor Rodr\'iguez-Doncel

Authors on Pith no claims yet

Pith reviewed 2026-05-14 22:51 UTC · model grok-4.3

classification 💻 cs.DB cs.AIcs.CY

keywords EU Data ActOntologyCompliance checkingSPARQL queriesData sharing agreementsRDF representationLegal informaticsB2C B2B B2G data access

0 comments

The pith

The DAOnt ontology turns key EU Data Act provisions into RDF structures so SPARQL queries can check data-sharing agreements for obligations, permissions, and prohibitions.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper builds DAOnt to give the EU Data Act a machine-readable form that supports automated compliance checks. It reuses three existing ontologies to model rights and duties in B2C user access, B2B trade-secret rules, and B2G data-use restrictions. The resulting model lets organisations run SPARQL queries that return the relevant obligations or prohibitions for any given data-sharing agreement. The work focuses on three specific articles to make compliance verification concrete and repeatable. By expressing legal concepts in RDF, the ontology makes it possible to test whether an agreement satisfies the chosen rules without manual legal reading.

Core claim

The paper claims that an ontology built by extending LKIF-Core, ODRL, and DPV with the normative elements of the Data Act can represent the main concepts and relationships in the Regulation, and that formalising Articles 4(1), 8(6), and 19(2)(a) produces SPARQL queries capable of returning the obligations, permissions, and prohibitions that apply to any data-sharing agreement, thereby enabling organisations to verify compliance and assess conditions such as FRAND obligations.

What carries the argument

The DAOnt ontology, which integrates selected legal and data-privacy ontologies to encode obligations, permissions, and prohibitions from the Data Act as RDF triples that SPARQL queries can directly inspect.

If this is right

Organisations can run queries to confirm whether a proposed agreement grants the user access rights required by Article 4(1).
Trade-secret exceptions under Article 8(6) become expressible as conditions that queries can test automatically.
Prohibitions on competitive use of B2G data under Article 19(2)(a) can be checked by returning matching prohibitions from the agreement.
FRAND and other conditions attached to data access can be retrieved as explicit permissions or obligations for review.
The RDF representation allows the same agreement data to be reused across multiple compliance queries without re-reading the legal text.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Extending the ontology to additional articles could create a broader automated checker for the entire Regulation.
Embedding the queries in data-management platforms would turn compliance review into a routine step rather than a separate legal task.
The same modelling approach could be applied to other recent EU data laws that share similar access and prohibition structures.
Public release of the ontology and queries invites third parties to test it against real agreements and surface any gaps in coverage.

Load-bearing premise

That the three chosen articles together with the reused ontologies are enough to capture the Data Act's normative structure without missing critical legal details that would affect compliance results.

What would settle it

A concrete data-sharing agreement that the SPARQL queries classify as compliant with the modelled articles yet is later shown by legal experts to violate the actual text of those articles, or the reverse case where the queries flag a violation that the law does not require.

Figures

Figures reproduced from arXiv: 2604.16386 by Fabian Linde, Mar\'ia Poveda-Villal\'on, Meem Arafat Manab, Sheyla Leyva-S\'anchez, V\'ictor Rodr\'iguez-Doncel.

**Figure 1.** Figure 1: A top-level diagram of the ontology, depicting most relevant classes. (Red tiles signify classes from the DAOnt ontology, blue from ODRL, green from DPV) [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗

**Figure 2.** Figure 2: Diagram depicting the principal classes and properties involved in DA Art. 4(1), based on the ODRL design pattern. (Red tiles signify classes from the DAOnt ontology, blue from ODRL) the absence of the mandatory action, while the second captures the absence of the legally permitted exception. When both conditions hold, the query precisely identifies the non-compliant behaviour described in Article 8(6). Co… view at source ↗

**Figure 3.** Figure 3: Diagram depicting the principal classes and properties involved in DA Art. 8(6), based on the ODRL design pattern. (Red tiles signify classes from the DAOnt ontology, blue from ODRL, gray signifies XML Schema Definitions) To detect this violation automatically, the SPARQL query in Listing 3 searches for B2G data-sharing cases where a PublicSectorBody performs an action classified as UseDataToDevelopCompeti… view at source ↗

**Figure 4.** Figure 4: Diagram depicting the principal classes and properties involved in DA Art. 19(2)(a), based on the ODRL design pattern. (Red tiles signify classes from the DAOnt ontology, blue from ODRL) 4.2. Automated Compliance Verification Engine These compliance verification queries are designed to detect Data Act violations through automated reasoning over RDF knowledge graphs. Such compliance checking may be needed i… view at source ↗

**Figure 5.** Figure 5: Complete Ontology Requirements Specification Document (ORSD) for DAOnt [PITH_FULL_IMAGE:figures/full_fig_p014_5.png] view at source ↗

read the original abstract

The EU Data Act establishes comprehensive rules governing data access and sharing across business-to-consumer (B2C), business-to-business (B2B), and business-to-government (B2G) contexts. This paper presents a comprehensive ontology for the EU Data Act, enabling reasoning over data sharing agreements through machine-readable representations. The DAOnt ontology reuses elements from three established ontologies, LKIF-Core, ODRL, and DPV, to capture the normative structure of the Data Act. The ontology captures the main concepts and relationships in the Regulation, and it also operationalises three articles to facilitate compliance checking: Article 4(1) (B2C user access rights), Article 8(6) (B2B trade secret exceptions) and Article 19(2)(a) (B2G competitive use prohibitions). The ontology supports compliance checking through SPARQL queries that return obligations, permissions, and prohibitions, allowing organisations to verify whether data-sharing agreements meet the requirements of the EU Data Act and to assess conditions such as FRAND obligations. By representing key legal concepts in RDF, our work helps bridge the gap between the legal provisions of the Data Act and their computational interpretation. The complete ontology, along with example instances and queries, is available online.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

DAOnt reuses LKIF-Core, ODRL and DPV to model three EU Data Act articles and supply SPARQL compliance queries, but supplies no validation that the outputs match legal interpretation.

read the letter

The DAOnt paper builds an ontology for the EU Data Act by reusing LKIF-Core, ODRL, and DPV, and it shows SPARQL queries for compliance on three articles. The modeling looks competent, but the work lacks any check that the results align with actual legal meaning. They do a good job picking the right source ontologies and applying them to specific provisions: Article 4(1) on user access in B2C, Article 8(6) on trade secret protections in B2B deals, and Article 19(2)(a) on prohibitions for government data use. The paper turns these into RDF classes and properties, gives example data-sharing agreements, and demonstrates queries that extract obligations, permissions, and prohibitions. Having the ontology and queries online helps others build on it. The main weakness is the absence of validation. There are no test cases where query outputs are compared to manual legal analysis, no input from lawyers on whether the formalization is accurate, and no discussion of edge cases or coverage gaps. This makes the claim that the system supports reliable compliance checking hard to assess. The paper is aimed at researchers in legal informatics and semantic technologies who work on regulatory compliance. Someone developing tools for EU data sharing rules would find the artifact and patterns useful as a base. It deserves serious peer review because the topic is current, the approach follows established methods, and the artifact is concrete, even though referees will want evidence of legal fidelity. I recommend sending it for review, with the expectation that the authors add validation examples or expert feedback during revision.

Referee Report

2 major / 2 minor

Summary. The manuscript presents the DAOnt ontology, which reuses elements from LKIF-Core, ODRL, and DPV to represent key concepts and relationships from the EU Data Act. It operationalizes three specific provisions—Article 4(1) on B2C user access rights, Article 8(6) on B2B trade secret exceptions, and Article 19(2)(a) on B2G competitive use prohibitions—and provides SPARQL queries that return obligations, permissions, and prohibitions to support compliance checking for data-sharing agreements.

Significance. If the formalization preserves legal semantics without omission or distortion, the ontology could provide a practical bridge between statutory text and automated reasoning tools, enabling organizations to verify FRAND conditions and other requirements in B2C, B2B, and B2G contexts. The public availability of the ontology, instances, and queries supports reproducibility and further extension.

major comments (2)

[SPARQL queries and compliance checking section] The description of SPARQL queries (in the compliance-checking section) presents example patterns for retrieving obligations/permissions/prohibitions but includes no test cases with known legal outcomes, no comparison of query results against manual legal analysis of the same fact patterns, and no coverage metrics. This leaves the central claim of reliable compliance checking unverified.
[Ontology design and article operationalization section] The modeling of Articles 4(1), 8(6), and 19(2)(a) (in the ontology design section) defines classes and properties drawn from the reused ontologies but provides no expert review of modeling decisions, no discussion of how statutory ambiguities are resolved, and no validation that the representation matches legal interpretation.

minor comments (2)

[Abstract and introduction] Clarify in the abstract and introduction whether the ontology is intended to cover the full Data Act or is limited to the three operationalized articles.
[Related work and ontology reuse section] Add explicit version numbers and DOIs for the reused ontologies (LKIF-Core, ODRL, DPV) in the related-work or ontology-reuse section.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive comments on our manuscript. We agree that strengthening the validation of the SPARQL queries and providing more transparency on modeling decisions will improve the paper. In the revised version, we will add test cases with expected legal outcomes and expand the ontology design section with explicit discussion of ambiguity resolutions and modeling rationale. These changes will better substantiate the compliance-checking claims while maintaining the focus on the DAOnt ontology's design and reuse of existing ontologies.

read point-by-point responses

Referee: The description of SPARQL queries (in the compliance-checking section) presents example patterns for retrieving obligations/permissions/prohibitions but includes no test cases with known legal outcomes, no comparison of query results against manual legal analysis of the same fact patterns, and no coverage metrics. This leaves the central claim of reliable compliance checking unverified.

Authors: We acknowledge that the manuscript presents the SPARQL queries primarily as illustrative patterns without accompanying test cases or direct comparisons to manual legal analysis. This reflects the paper's emphasis on ontology construction rather than a comprehensive evaluation study. To address the concern, we will add a new subsection in the compliance-checking section that includes three concrete test cases based on hypothetical but realistic data-sharing fact patterns for the operationalized articles. Each case will specify input data, the expected legal outcome drawn from the Data Act provisions, the executed SPARQL query results, and a side-by-side comparison. We will also include coverage metrics limited to the three articles (Articles 4(1), 8(6), and 19(2)(a)). This revision will provide the requested verification without requiring changes to the ontology itself. revision: yes
Referee: The modeling of Articles 4(1), 8(6), and 19(2)(a) (in the ontology design section) defines classes and properties drawn from the reused ontologies but provides no expert review of modeling decisions, no discussion of how statutory ambiguities are resolved, and no validation that the representation matches legal interpretation.

Authors: The modeling reuses classes and properties from LKIF-Core, ODRL, and DPV to promote interoperability and avoid reinventing normative concepts. For example, user access rights under Article 4(1) are represented using ODRL permission structures. Statutory ambiguities, such as the precise boundaries of trade secret protections in Article 8(6) or competitive use prohibitions in Article 19(2)(a), were resolved by aligning with the regulation's recitals and the European Commission's explanatory guidance. We will revise the ontology design section to include a dedicated discussion of these modeling decisions and ambiguity resolutions, with direct references to the legal text. While the development did not include a formal review by external legal experts, the representations were derived from close textual analysis. We will note the absence of such expert validation as a limitation and identify it as an avenue for future work. This provides greater transparency on the design process. revision: partial

Circularity Check

0 steps flagged

No significant circularity in statutory modeling via external ontologies

full rationale

The paper constructs DAOnt by directly reusing classes and properties from established external ontologies (LKIF-Core, ODRL, DPV) and manually encoding the normative content of three specific Data Act articles into RDF. Compliance checking is performed by SPARQL queries over these explicit representations. No equations, fitted parameters, predictions, or uniqueness theorems appear; therefore no step reduces by construction to its own inputs. The modeling chain is self-contained and draws on independent legal text plus third-party ontologies.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard semantic-web representation languages and the assumption that three existing ontologies can be combined to cover the Data Act's normative content without additional legal interpretation layers.

axioms (2)

standard math RDF/OWL and SPARQL are adequate for representing and querying legal obligations, permissions, and prohibitions.
Standard assumption in semantic-web legal ontologies.
domain assumption LKIF-Core, ODRL, and DPV together contain the necessary concepts to model the selected articles of the EU Data Act.
Core modeling choice stated in the abstract; no independent verification supplied.

pith-pipeline@v0.9.0 · 5556 in / 1287 out tokens · 30283 ms · 2026-05-14T22:51:50.819188+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

The DAOnt ontology reuses elements from three established ontologies, LKIF-Core, ODRL, and DPV, to capture the normative structure of the Data Act... supports compliance checking through SPARQL queries that return obligations, permissions, and prohibitions

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

19 extracted references · 19 canonical work pages

[1]

N. Casellas, Legal Ontology Engineering: Methodologies, Modelling Trends, and the Ontology of Professional Judicial Knowledge, Law, Governance and Technology Series, Springer Netherlands,

work page
[2]

URL: https://books.google.es/books?id=JBR2zq-voVQC

work page
[3]

C. M. de Oliveira Rodrigues, F. L. G. de Freitas, E. F. S. Barreiros, R. R. de Azevedo, A. de Almeida Filho, Legal ontologies over time: A systematic mapping study, Expert Sys- tems with Applications 130 (2019) 12–30. URL: https://www.sciencedirect.com/science/article/pii/ S0957417419302398. doi:https://doi.org/10.1016/j.eswa.2019.04.009

work page doi:10.1016/j.eswa.2019.04.009 2019
[4]

Hoekstra, J

R. Hoekstra, J. Breuker, M. D. Bello, A. Boer, Lkif core: Principled ontology development for the legal domain, in: J. Breuker, P. Casanovas, M. C. A. Klein, E. Francesconi (Eds.), Law, Ontologies and the Semantic Web, volume 188 ofFrontiers in Artificial Intelligence and Applications, IOS Press, 2009, pp. 21–52. doi:10.3233/978-1-58603-942-4-21

work page doi:10.3233/978-1-58603-942-4-21 2009
[5]

Palmirani, G

M. Palmirani, G. Governatori, A. Rotolo, S. Tabet, H. Boley, A. Paschke, Legalruleml: Xml-based rules and norms, in: Rule-Based Modeling and Computing on the Semantic Web, volume 7018 ofLecture Notes in Computer Science, Springer, 2011, pp. 298–312. URL: https://link.springer.com/ chapter/10.1007/978-3-642-24908-2_30. doi:10.1007/978-3-642-24908-2_30

work page doi:10.1007/978-3-642-24908-2_30 2011
[6]

Bassiliades, G

N. Bassiliades, G. Governatori, A. Paschke (Eds.), Rule Representation, Interchange and Reasoning on the Web, volume 5321 ofLecture Notes in Computer Science, Springer, 2008

work page 2008
[7]

Iannella, S

R. Iannella, S. Villata, ODRL Information Model 2.2, W3C Recommendation REC-odrl-model- 20180215, World Wide Web Consortium (W3C), 2018. URL: https://www.w3.org/TR/2018/ REC-odrl-model-20180215/, editors: Renato Iannella (Monegraph), Serena Villata (INRIA)

work page 2018
[8]

Iannella, M

R. Iannella, M. Steidl, S. Myles, V. R. Doncel, ODRL Vocabulary & Expression 2.2, W3C Recom- mendation REC-odrl-vocab-20180215, World Wide Web Consortium (W3C), 2018. URL: https: //www.w3.org/TR/2018/REC-odrl-vocab-20180215/, editors: Renato Iannella (Monegraph), Michael Steidl (IPTC), Stuart Myles (AP), Víctor Rodríguez Doncel (UPM)

work page 2018
[9]

Robaldo, C

L. Robaldo, C. Bartolini, G. Lenzini, The dapreco knowledge base: Representing the gdpr in legalruleml, in: Proceedings of the Twelfth Language Resources and Evaluation Conference (LREC 2020), European Language Resources Association, Marseille, France, 2020, pp. 5688–5697. URL: https://aclanthology.org/2020.lrec-1.698/

work page 2020
[10]

H. J. Pandit, C. Debruyne, D. O’Sullivan, D. Lewis, GConsent: A consent ontology based on the GDPR, in: Proceedings of the 16th Extended Semantic Web Conference (ESWC 2019), vol- ume 11503 ofLecture Notes in Computer Science, 2019, pp. 270–282. URL: https://doi.org/10.1007/ 978-3-030-21348-0_18. doi:10.1007/978-3-030-21348-0_18

work page doi:10.1007/978-3-030-21348-0_18 2019
[11]

Palmirani, M

M. Palmirani, M. Martoni, A. Rossi, C. Bartolini, L. Robaldo, Pronto: Privacy ontology for legal reasoning, in: A. Kő, E. Francesconi (Eds.), Electronic Government and the Information Systems Per- spective (EGOVIS 2018), volume 11032 ofLecture Notes in Computer Science, Springer, 2018, pp. 139–

work page 2018
[12]

doi: 10.1007/978-3-319-98349-3_ 11

URL: https://doi.org/10.1007/978-3-319-98349-3_11. doi: 10.1007/978-3-319-98349-3_ 11

work page doi:10.1007/978-3-319-98349-3_11
[13]

J. Wu, X. Xue, J. Zhang, Invariant signature, logic reasoning, and semantic natural language processing (nlp)-based automated building code compliance checking (i-snacc) framework, Journal of Information Technology in Construction 28 (2023)

work page 2023
[14]

De Vos, S

M. De Vos, S. Kirrane, J. Padget, K. Satoh, Odrl policy modelling and compliance checking, in: International Joint Conference on Rules and Reasoning, Springer, 2019, pp. 36–51

work page 2019
[15]

Golpayegani, H

D. Golpayegani, H. J. Pandit, D. Lewis, Airo: An ontology for representing ai risks based on the proposed eu ai act and iso risk management standards, in: Towards a knowledge-aware AI, IOS Press, 2022, pp. 51–65

work page 2022
[16]

M. C. Suárez-Figueroa, A. Gómez-Pérez, E. Motta, A. Gangemi, The NeOn Methodology for Ontology Engineering, Springer, 2012

work page 2012
[17]

Chávez-Feria, C

S. Chávez-Feria, C. A. Iglesias, Chowlk: From uml to owl automatically, in: Proceedings of the 21st International Semantic Web Conference (ISWC 2022) – Demo Track, 2022

work page 2022
[18]

Garijo, Widoco: A wizard for documenting ontologies, in: The Semantic Web–ISWC 2017, Springer, 2017, pp

D. Garijo, Widoco: A wizard for documenting ontologies, in: The Semantic Web–ISWC 2017, Springer, 2017, pp. 94–102

work page 2017
[19]

Chaves-Fraga, D

D. Chaves-Fraga, D. Garijo, M. Poveda-Villalón, O. Corcho, Ontoology: A tool for automating ontology documentation, evaluation, and publication, in: Proceedings of the 6th Workshop on Linked Data on the Web (LDOW 2013), 2013. A. Full Ontology Requirements Specification Document (ORSD) Figure 5:Complete Ontology Requirements Specification Document (ORSD) for DAOnt

work page 2013