Skip to content
Open access

LLM-Based Formalization of Engineering Requirements into Ontology-Constrained Knowledge Graphs

Jul 2026 · Journal of Mechanical Design · Vol 148 · 0 citations

TL;DR

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.

Abstract

Requirements engineering plays a central role in mechanical design, yet technical requirements remain predominantly expressed in natural language, limiting traceability, validation, and computational reasoning. This work presents an ontology-constrained pipeline for transforming natural-language engineering requirements into Industrial Ontologies Foundry (IOF)-grounded knowledge graphs enriched with QUDT-based quantitative semantics. The pipeline decomposes text blocks into individual prescriptive clauses, extracts structural slots and constraint atoms through a typed intermediate representation, normalizes quantitative expressions via QUDT unit and quantity-kind grounding, and instantiates IOF-compliant OWL ABox graphs. The transformation is implemented as a hybrid neuro-symbolic workflow that combines Large Language Models (LLMs) with typed intermediate representations, rule-based post-processing, and description-logic reasoning. Evaluation on a Formula SAE (FSAE) rules corpus, intentionally selected to stress quantitative constraint handling, shows good structural reliability in the evaluated setting. Slot-level extraction achieved a macro accuracy of 94.50%, while quantitative constraint identification reached 97.64% precision and 96.88% recall. Normalization coverage was 98.78%, with residual errors primarily attributable to quantity-kind disambiguation. At the graph level, 93.33% of grounded artifacts passed all ontology-conformance checks, with residual violations concentrated in requirement–specification linkage and specification typing rather than in quantitative-value modeling or systematic misuse of the IOF backbone. These 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.

Read PDF

Similar papers

Preprint Aug 2026

GrOIL: Graph-Grounded Domain Ontology Induction with Constrained LLM Mediation

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
Jul 2026

LLM-Assisted Ontology Engineering and Construction of a French Legal Knowledge Graph

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. · 0 citations
#large language models Book Open access Oct 2026

OntoSTL: Canonical Knowledge Graph Representation of Signal Temporal Logic Requirements

Formal verification of safety-critical cyber-physical systems uses languages such as Signal Temporal Logic (STL) to express time-sensitive properties over real-valued signals. However, large collections of formal requirements often contain recurring structural patterns that remain hidden in syntactically different formulas. Model-Driven Engineering supports requirement traceability, although existing methods provide limited means to identify and exploit these patterns within requirement sets. We address this limitation through OntoSTL, which first transforms STL formulas into Web Ontology Language (OWL) knowledge graphs then performs canonicalization on the formulas. The resulting representation supports querying with the SPARQL Protocol and RDF Query Language (SPARQL) and validation with the Shapes Constraint Language (SHACL). OntoSTL defines a bidirectional transformation between STL and OWL and applies equivalence-preserving canonicalization rules, including implication elimination, supported Negation Normal Form (NNF) conversion, Boolean simplification, associative flattening, and deterministic operand ordering. An analysis of 8,888 STL formulas identified 2,439 distinct structural topologies before canonicalization and 2,032 afterward, which indicates structural redundancy. The transformation algorithms terminate and preserve the information required to reconstruct formulas within the supported STL fragment. Empirical evaluation demonstrates round-trip structural preservation and an average processing time of 2.22 ms per formula.

Haitham Al-Shami, Riku Ala-Laurinaho, Xin-Yi Tu et al. · 0 citations
Conference Open access 2026

From Natural Language to Executable Optimization Workflows: A Knowledge-Graph-Driven Framework for Multidisciplinary Optimization

Early-stage engineering design requires balancing competing performance, cost, and feasibility criteria across interacting disciplinary models. However, deploying multidisciplinary optimization (MDO) frameworks remains difficult because translating high-level requirements into executable optimization workflows often requires substantial manual effort in workflow configuration, tool integration, and dependency management. This paper presents a knowledge-graph-grounded framework that automatically translates free-form natural-language requirements into validated and executable MDO workflows. A locally hosted large language model extracts structured optimization intents, while a domain knowledge graph maps these intents to canonical variables, retrieves metadata, and generates dependency-consistent execution plans. Candidate designs are evaluated through orchestrated Python-based model execution with workbook reuse, and a population-based genetic optimizer searches the bounded decision-variable space while enforcing feasibility through penalty-based ranking. Transparency is supported through parsed intents, confidence scoring, and deterministic post-validation. The framework is demonstrated through a vehicle concept optimization case study for early-stage design exploration.

Aref Aghaee Hakkak, Anton Wiberg, M. Tarkian · 0 citations
2026

DeLTA: A Description Logic-based Annotation Schema for Constructing Expressive OWL DL Axioms from Text

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 claims.

I. Baimuratov · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.