TIO-SHACL: Comprehensive SHACL validation for TMF Intent Ontologies
Pith reviewed 2026-05-07 10:37 UTC · model grok-4.3
The pith
tio-shacl supplies the first full set of SHACL shapes and constraints to validate every element of the TMF Intent Ontology.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We present tio-shacl, the first comprehensive SHACL validation framework for the TMF Intent Ontology. Our contribution includes 56 node shapes and 69 property shapes across all 15 tio v3.6.0 ontology modules, a reusable constraint library with 25 parameterized SPARQL-based constraint components, and novel validation patterns for recursive logical operators, quantity-based constraints, and cross-expectation relationships. We pursued 100% vocabulary coverage (87 classes, 109 properties, 72 functions), cross-implementation compatibility across three major SHACL engines, and validation accuracy on a corpus of 133 test cases.
What carries the argument
The collection of 56 node shapes and 69 property shapes together with 25 parameterized SPARQL constraint components that enforce the ontology rules, including dedicated patterns for recursive operators and cross-expectation links.
If this is right
- Operators can run automated syntactic and semantic checks on intents before admission to the network.
- The reusable SPARQL constraint library supports customization for specific network policies.
- Validation works across different SHACL engine implementations for broad deployment.
- All 15 ontology modules receive uniform coverage so no vocabulary element escapes checking.
Where Pith is reading between the lines
- The same SHACL pattern library could be adapted to validate intents in other standardized ontologies outside TMF.
- Embedding tio-shacl into intent admission pipelines would catch errors earlier than manual review alone.
- Running the validator against real-world intent corpora from production networks could surface additional constraint refinements.
Load-bearing premise
The defined shapes and constraints accurately and completely capture the intended meaning of the tio ontology without missing valid intents or incorrectly accepting invalid ones.
What would settle it
A collection of intents judged valid by domain experts that tio-shacl rejects, or a set of invalid intents that it accepts.
Figures
read the original abstract
Intent-based networking promises to revolutionize telecommunications network management by enabling operators to specify high-level goals rather than low-level configurations. The TM Forum Intent Ontology (tio) provides a standardized vocabulary for expressing network intents, yet lacks formal validation mechanisms to ensure intent correctness before its admission. We present tio-shacl, the first comprehensive SHACL (Shapes Constraint Language) validation framework for the TMF Intent Ontology. Our contribution includes 56 node shapes and 69 property shapes across all 15 tio v3.6.0 ontology modules, a reusable constraint library with 25 parameterized SPARQL-based constraint components, and novel validation patterns for recursive logical operators, quantity-based constraints, and cross-expectation relationships. We pursued 100% vocabulary coverage (87 classes, 109 properties, 72 functions), cross-implementation compatibility across three major SHACL engines, and validation accuracy on a corpus of 133 test cases. tio-shacl is publicly available under MIT license at https://github.com/EricssonResearch/tio-shacl and enables automated syntactic and semantic validation of network intents, addressing a critical gap in the field.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript presents tio-shacl as the first comprehensive SHACL validation framework for the TMF Intent Ontology (tio v3.6.0). It describes 56 node shapes and 69 property shapes providing 100% vocabulary coverage across all 15 modules (87 classes, 109 properties, 72 functions), a reusable library of 25 parameterized SPARQL constraint components, and novel patterns for recursive logical operators, quantity-based constraints, and cross-expectation relationships. The authors report cross-engine compatibility with three major SHACL implementations and 100% validation accuracy on a corpus of 133 test cases, with the full implementation released publicly under the MIT license.
Significance. If the hand-encoded shapes and constraints accurately reflect the intended semantics of tio v3.6.0, the work would provide a practical and much-needed tool for automated validation of network intents in telecommunications, directly addressing the absence of formal validation mechanisms noted in the abstract. The public release of the shapes, code, and constraint library, together with the reported cross-engine compatibility, are explicit strengths that support reproducibility and adoption.
major comments (3)
- Abstract and Evaluation: the reported 100% accuracy on the 133 test cases is stated without any description of test-case construction, coverage of edge cases (recursive operators, cross-module relationships, or quantity constraints), or the precise measurement protocol, leaving the central claim of correct and complete validation only partially verifiable.
- Shapes and Constraint Library: the 56 node shapes, 69 property shapes, and 25 SPARQL components are manually derived from the published tio v3.6.0 specification; the manuscript supplies neither a formal semantics of the ontology nor an independent oracle (e.g., OWL reasoner or reference implementation) against which omissions or over-constraints could be detected, so the 133-case corpus cannot rule out silent mismatches.
- Novel Patterns: the patterns claimed for recursive logical operators and cross-expectation relationships are presented as solutions to SHACL limitations, yet no formal argument or exhaustive test is given showing that these patterns preserve the ontology's intended semantics under recursion.
minor comments (1)
- The manuscript would benefit from an appendix listing the 25 SPARQL constraint components in full, together with their parameterizations, to allow direct inspection by readers.
Simulated Author's Rebuttal
We thank the referee for the constructive comments on our manuscript. We address each of the major comments point by point below, indicating where revisions will be made to the next version of the paper.
read point-by-point responses
-
Referee: Abstract and Evaluation: the reported 100% accuracy on the 133 test cases is stated without any description of test-case construction, coverage of edge cases (recursive operators, cross-module relationships, or quantity constraints), or the precise measurement protocol, leaving the central claim of correct and complete validation only partially verifiable.
Authors: We agree with this observation. The revised manuscript will include an expanded Evaluation section that details the construction of the 133 test cases, explicitly covering edge cases involving recursive operators, cross-module relationships, and quantity constraints. We will also describe the protocol for measuring validation accuracy across the SHACL engines. revision: yes
-
Referee: Shapes and Constraint Library: the 56 node shapes, 69 property shapes, and 25 SPARQL components are manually derived from the published tio v3.6.0 specification; the manuscript supplies neither a formal semantics of the ontology nor an independent oracle (e.g., OWL reasoner or reference implementation) against which omissions or over-constraints could be detected, so the 133-case corpus cannot rule out silent mismatches.
Authors: The TMF Intent Ontology specification does not include a formal semantics or reference implementation. Our shapes were manually encoded to match the published vocabulary and constraints exactly, achieving full coverage. To address this, we will add a detailed account of the shape derivation methodology and map each test case to the specific shapes it validates. This will make the validation claims more transparent, though an independent oracle remains unavailable. revision: partial
-
Referee: Novel Patterns: the patterns claimed for recursive logical operators and cross-expectation relationships are presented as solutions to SHACL limitations, yet no formal argument or exhaustive test is given showing that these patterns preserve the ontology's intended semantics under recursion.
Authors: We will revise the manuscript to include additional exhaustive tests for the recursive patterns and cross-expectation relationships, demonstrating their behavior on a range of inputs that exercise recursion. While a formal semantic proof is not feasible without a formal ontology semantics, the empirical tests confirm alignment with the specification's intent. We will clarify this in the text. revision: partial
- The provision of a formal semantics for the tio ontology or an independent oracle, as these are not part of the published tio v3.6.0 specification.
Circularity Check
No circularity: SHACL shapes are direct manual encodings of the external tio v3.6.0 ontology specification
full rationale
The paper derives its 56 node shapes, 69 property shapes, and 25 SPARQL constraint components by direct inspection and encoding of the published TMF Intent Ontology (tio v3.6.0) vocabulary and rules. No equations, fitted parameters, or predictions appear; the 100% coverage claim and 133-case accuracy are post-hoc empirical checks on the hand-written shapes rather than inputs that force the result. No self-citations are load-bearing for the central construction, and no uniqueness theorems or ansatzes are imported from prior author work. The derivation remains self-contained against the independent ontology document.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption SHACL is an appropriate and sufficiently expressive language for capturing the syntactic and semantic constraints of the TMF Intent Ontology, including recursive logical operators.
Reference graph
Works this paper leans on
-
[1]
Rfc, IETF (2022), https://www.rfc-editor
Clemm, J., Ciavaglia, L., Granville, L., Tantsura, J.: RFC 9315: Intent-Based Networking - Concepts and Definitions. Rfc, IETF (2022), https://www.rfc-editor. org/rfc/rfc9315 TIO-SHACL: Validation for TMF Intent Ontology 15
work page 2022
-
[2]
W3c recommendation, W3C (2017), https://www.w3.org/TR/shacl/
Knublauch, H., Kontokostas, D.: Shapes Constraint Language (SHACL). W3c recommendation, W3C (2017), https://www.w3.org/TR/shacl/
work page 2017
-
[3]
TM Forum: IG1253: Intent in Autonomous Networks. Introductory guide, TM Forum (2022), https://www.tmforum.org/resources/how-to-guide/ ig1253-intent-in-autonomous-networks-v1-3-0/
work page 2022
-
[4]
TM Forum: IG1252: Autonomous Networks - Levels and Characteristics. Introductory guide, TM Forum (2023), https://www.tmforum.org/resources/ introductory-guide/ig1252-autonomous-networks-levels/
work page 2023
-
[5]
TM Forum: IG1358: Intent-Based Operation User Guide. Introductory guide, TM Forum (2024), https://www.tmforum.org/resources/introductory-guide/ ig1358-intent-based-operation-user-guide-v1-0-0/
work page 2024
-
[6]
TM Forum: TR290: Intent Common Model. Technical report, TM Forum (2024), https://www.tmforum.org/resources/technical-report/ tr290-intent-common-model-v3-6-0/
work page 2024
-
[7]
TM Forum: TR291A: Intent Validity. Technical report, TM Fo- rum (2024), https://www.tmforum.org/resources/introductory-guide/ tr291a-intent-validity-intent-extension-model-v3-6-0/
work page 2024
-
[8]
TM Forum: TR291C: Proposal of Best Intent. Technical report, TM Forum (2024), https://www.tmforum.org/resources/standard/ tr291c-proposal-of-best-intent-intent-extension-model-v3-6-0/
work page 2024
-
[9]
TM Forum: TR291G: Preference of Intent Handling Outcomes. Techni- cal report, TM Forum (2024), https://www.tmforum.org/resources/standard/ tr291g-preference-of-intent-handling-outcomes-intent-extension-model-v3-6-0/
work page 2024
-
[10]
TM Forum: TR291H: Intent Guarantee. Technical report, TM Fo- rum (2024), https://www.tmforum.org/resources/introductory-guide/ tr291h-intent-guarantee-intent-extension-model-v3-6-0/
work page 2024
-
[11]
Technical report, TM Forum (2024), https://www
TM Forum: TR291I: Utility. Technical report, TM Forum (2024), https://www. tmforum.org/resources/standard/tr291i-utility-intent-extension-model-v3-6-0/
work page 2024
-
[12]
TM Forum: TR292: TM Forum Intent Ontology (TIO). Technical report, TM Forum (2024), https://www.tmforum.org/resources/introductory-guide/ tr292-tm-forum-intent-ontology-tio-v3-6-0/
work page 2024
-
[13]
TM Forum: TR292A: Intent Management Elements. Technical report, TM Forum (2024), https://www.tmforum.org/resources/introductory-guide/ tr292a-intent-management-elements-v3-6-0/
work page 2024
-
[14]
TM Forum: TR292B: Intent Management State Machines. Technical re- port, TM Forum (2024), https://www.tmforum.org/resources/introductory-guide/ tr292b-intent-management-state-machines-v3-6-0/
work page 2024
-
[15]
TM Forum: TR292C: Function Definition Ontology. Technical report, TM Forum (2024), https://www.tmforum.org/resources/introductory-guide/ tr292c-function-definition-ontology-v3-6-0/
work page 2024
-
[16]
TM Forum: TR292D: Quantity Ontology. Technical report, TM Fo- rum (2024), https://www.tmforum.org/resources/introductory-guide/ tr292d-quantity-ontology-v3-6-0/
work page 2024
-
[17]
TM Forum: TR292E: Conditions and Logical Operators. Technical report, TM Forum (2024), https://www.tmforum.org/resources/introductory-guide/ tr292e-logical-operators-v3-6-0/
work page 2024
-
[18]
TM Forum: TR299: Intent Specification. Technical report, TM Fo- rum (2024), https://www.tmforum.org/resources/introductory-guide/ tr299-intent-specification-v3-6-0/
work page 2024
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.