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.
Abstract
Maintenance regulations are complex legal texts that are difficult to exploit when addressing a specific case and challenging to integrate into operational systems. This paper presents a two-stage LLM-assisted workflow for French maintenance regulations: ontology engineering from a SEMLEG-based core ontology, followed by construction of an ontology-grounded French legal knowledge graph. The first stage consists in the open extraction of typed entities and triples from a stratified corpus sample, the normalization of labels through embedding-based fusion, and the induction of candidate object properties with their signature (domain and range). The second stage uses the resulting ontology to guide the closed extraction of triples and RDF graph construction over the full corpus. Experiments with GPT-4.1 and mistral-large-2512 show robust structured outputs, near-complete class alignment, and a substantial reduction of duplicated entities and predicates after fusion. Fewer than 20% of triples introduce unseen properties, while lower exact signature compliance reveals new domain-range combinations for existing predicates. These results point to predicate normalization and the validation of newly observed relation signatures as key refinement steps for industrial maintenance settings.
Results indicate that ontology-constrained LLM pipelines can support the formalization of engineering requirements into semantically explicit graph representations that are suitable for downstream querying, validation, and analysis.
A. Stefanone, M. Rossoni, Giorgio Colombo· Journal of Mechanical Design· 0 citations
A seven-stage graph-grounded pipeline that converts domain documents into a complete, auditable Web Ontology Language (OWL) Terminological Box (TBox) without any unconstrained generation step is presented, demonstrating that the pipeline produces stable, reusable domain representations from large document corpora.
Maruf Ahmed Mridul, A. Talukder, O. Seneviratne· 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
This work proposes a domain-independent text annotation schema that maps directly to OWL DL syntax, enabling the algorithmic generation of expressive axioms from the annotations, and demonstrates the applicability and scalability of the approach through two distinct use cases: building requirements and scientific claim...
A production extraction layer that converts a live document stream into a validated knowledge graph aligned to a formal ontology, and improved search recall from roughly 70 to 95 percent with no false merges, and corrected seven classes of silent quality defect.
Vaibhav Dangaich, Kevin Lewis, Kundeshwar Pundalik· arXiv.org· 0 citations
The exponential growth of biomedical regulatory documentation has created an urgent need for automated, scalable knowledge structuring mechanisms that do not rely on rigid, expert-curated ontologies. This paper presents the system implementation and empirical analysis of the Ontology-Free Biomedical Knowledge Graph Ind...
Ahlem Ben Younes, Baha Eddine Kalai, Laila Ben Ayed et al.· Annual International Compute...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.