This article proposes an ontology to formalize non-disclosure agreements (NDAs) at the University of Caldas, Colombia, understood as a specific case within the broader management of IP agreements.
Abstract
The management of intellectual property (IP) agreements in universities continues to rely on static legal documents that are signed, archived, and consulted when necessary, but whose content is rarely formalized to facilitate their operation and verification. Consequently, obligations, permissions, restrictions, deadlines, scopes, and exceptions often remain scattered across clauses drafted in natural language, annexes, emails, and different document versions, which hinders their monitoring and makes compliance review dependent on intensive legal and administrative work. In response to this limitation, this article proposes an ontology to formalize non-disclosure agreements (NDAs) at the University of Caldas, Colombia, understood as a specific case within the broader management of IP agreements. The proposal adopts a modular Semantic Web architecture composed of a reusable ontological core and a specialized profile for NDAs. Its construction followed the METHONTOLOGY methodology, and its specification was supported by Competency Questions (CQs), which were subsequently translated into SHACL constraints and SPARQL queries. In addition, a SKOS vocabulary is incorporated to normalize synonyms and terminological variants typical of legal drafting in Spanish, together with a lightweight weak supervision layer based on regular expressions, SKOS, and structural signals to support clause labeling and the batch generation of RDF instances. Thus, the proposal enables querying, traceability, and verification over NDA content, while offering a formal basis for progressing toward automatable controls and their eventual articulation with smart contracts.
A two-stage LLM-assisted workflow for French maintenance regulations is presented: ontology engineering from a SEMLEG-based core ontology, followed by construction of an ontology-grounded French legal knowledge graph.
Génesis Montenegro, M. Billami, Catherine Faron et al.· arXiv.org· 0 citations
The goal of this work is to put into context recent updates in ontology engineering and present the necessary additional information targeted to reuse by providing an updated overview and proposing a two-tier categorisation, believed to be the first review to offer such an intra-category classification.
Davide Di Pierro, L. Abrouk, A. Guyot et al.· 0 citations
The results support the feasibility of ontology-driven generation for static-classification systems, whereas arithmetic risk computation and temporal event processing remain better suited to complementary procedural technologies.
Borivoj Bogdanović, S. Nikolić· Computers· 0 citations
Enterprise adoption of large language models in finance is constrained less by fluency than by trust: in Financial Planning and Analysis (FP&A) and other regulated workflows, an answer is usable only if it is traceable to authoritative sources and auditable after the fact. This paper argues that retrieval-augmented generation for enterprise finance should be evaluated on auditability alongside accuracy, and presents the Knowledge-Driven Analytics Framework (KDAF), which builds ontology-driven knowledge systems through six iterative stages and retrieves evidence via Context-Aware Relevance Propagation (CARP), so that every retrieved fact carries its relationship type, confidence, and source lineage. An evaluation on FinanceBench (145 questions) compares KDAF against zero-context inference, BM25, concept-weighted lexical retrieval, and ungrounded graph traversal. First, retrieval is necessary: zero-context inference reaches 4.1% correctness against 10-12% for retrieval-augmented conditions. Second, on answer correctness the retrieval conditions are statistically indistinguishable (KDAF vs BM25: -0.007, 95% CI [-0.021, 0.000]), so accuracy alone does not justify structured retrieval here -- a negative result we report explicitly. Third, on auditability the ordering reverses: KDAF attains the highest citation traceability F1 (0.515), exceeding ungrounded traversal by +0.027 (CI [0.006, 0.050]) and BM25 by +0.052 (CI [0.024, 0.083]), intervals excluding zero. Graph-structured retrieval also admits no evidence from outside the question subject entity (0 of 426 items, against 16.8% and 20.2% for lexical baselines), and every selected item resolves to a complete provenance chain. We argue that auditability, not accuracy, is the axis on which ontology-grounded retrieval earns its cost.
Overall, the findings suggest that MALTG provides a formally grounded and reproducible approach for automating multi-framework LegalTech governance conformance assessment while maintaining semantic and structural traceability between normative models and operational architectures.
Patricio M. Paccha-Angamarca, Erwin J. Sacoto-Cabrera, Víctor V. Velepucha-Bonett· Information· 0 citations
Large Language Models (LLMs) have significant potential in regulated domains such as law, healthcare, and compliance, where users need help interpreting complex rules and documents. However, these domains also make the risks of Large Language Models especially serious: a system may hallucinate legal authority, rely on outdated rules, mix jurisdictions, or expose sensitive information. Retrieval-Augmented Generation (RAG) reduces these risks by grounding the model’s answer in a curated document corpus, but standard RAG still does not guarantee that the retrieved sources are legally valid, up to date, applicable to the correct jurisdiction, or safe to use. In this paper, we present an ontology-governed approach to legal RAG. The central idea is to use a legal ontology not merely as background knowledge, but as an active control layer. Before retrieval, the ontology filters legal sources by jurisdiction, topic, lifecycle status, and temporal validity. After generation, validation rules check whether the answer is supported by approved evidence, cites valid legal sources, respects jurisdictional boundaries, and avoids unsafe or privacy-violating content. The system also records retrieval, validation, and response-generation steps in an audit trail to support later review. In this way, the proposed Legal Rule Auditor extends Graph RAG from a retrieval-enhancement technique into a governance architecture for legal question answering. Its goal is not simply to improve answer relevance, but to ensure that answers are legally grounded, trusted, current, jurisdictionally appropriate, and traceable.
Aymen Akremi· Computers· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
