| Internet-Draft | Intent Translation for IoT | June 2026 |
| Gu, et al. | Expires 25 December 2026 | [Page] |
This document describes an intent translation framework for Internet of Things (IoT) and next-generation network management environments. The framework converts user-issued natural language intents into structured policy representations that can be consumed by management and orchestration systems.¶
The framework decomposes intent interpretation into parallel role-and-scenario classification and entity-and-slot extraction, merges the results into an intermediate representation, and generates a candidate policy document under schema-as-grammar constraints derived from the target schema. A policy validator then checks the candidate output for schema conformance, cross-slot consistency, and faithfulness to the original intent. When validation fails, a trace driven recovery agent dispatches targeted regeneration or re-extraction rather than relying on generic retry.¶
This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.¶
Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is at https://datatracker.ietf.org/drafts/current/.¶
Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."¶
This Internet-Draft will expire on 25 December 2026.¶
Copyright (c) 2026 IETF Trust and the persons identified as the document authors. All rights reserved.¶
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Revised BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Revised BSD License.¶
The rapid growth of Internet of Things (IoT) deployments and the evolution toward 6G networks have introduced increasing complexity in the management of heterogeneous devices, services, and application policies. As operational environments scale, the traditional model of manually configuring service-level policies becomes unsustainable.¶
Intent-based management is a paradigm that allows administrators to specify desired outcomes through high-level intents, often expressed in natural language [Survey-IBN-CST-2023], [USENIX-ATC-Lumi], [I-D.jeong-nmrg-ibn-network-management-automation]. These intents must then be interpreted, validated, and translated into structured policy representations that can be executed by network functions and orchestrators. Recent work has explored the use of large language models for this translation step [Mekrache-IBN]. While standards such as 3GPP TS 28.312 [TS-28.312] define lifecycle procedures and an OpenAPI schema for managing intents in mobile networks and TR 28.812 [TR-28.812] describes the scenarios that motivate them, they do not specify mechanisms for interpreting natural language or translating it into compliant policy structures.¶
A central difficulty observed in recent industry benchmarks [GSMA-TeleYAML] is the so-called structural-semantic gap: a policy document may be syntactically valid against the schema while still being semantically incoherent across slots (for example, declaring an object type that is incompatible with the chosen target metric). Linguistic proficiency of a language model alone is insufficient to close this gap; standards-grounded structural constraints and post-generation validation are also required.¶
This document defines a modular intent translation framework that addresses this gap. The framework enables automated conversion of user-issued intents into structured policy representations, for example serialized as YAML or JSON, derived from the policy modeling and management service interfaces defined in 3GPP TS 28.312 [TS-28.312]. It supports a range of use cases across IoT domains, including resource optimization, security management, and service quality assurance.¶
The framework is composed of four functional components that operate in a partially parallel pipeline, plus a deterministic merge step and a feedback router:¶
Scenario Extractor: Classifies the input intent along two axes - the management role (e.g., service customer, service provider, or network operator) and the deployment scenario (e.g., radio network, radio service, edge service support, or 5G core network) - producing a coordinate that routes downstream processing.¶
Slot Extractor: Extracts entities and structured slot values (such as target name, target value, target unit, and target condition) from the same natural language input, in parallel with the Scenario Extractor.¶
Intent Composer: Merges the outputs of the two Extractors into a single structured intermediate representation that the Policy Generator consumes.¶
Policy Generator: Synthesizes a candidate policy document, typically serialized as YAML or JSON, under schema-as-grammar constraints derived from the target schema.¶
Policy Validator: Evaluates the candidate policy along three dimensions - schema validity, cross-slot semantic invariants, and semantic faithfulness to the original natural language input - and produces a failure-mode trace when violations occur.¶
A trace driven recovery agent consumes the validator's failure-mode trace and dispatches targeted regeneration to the appropriate upstream component, rather than performing generic retry. The design promotes modularity, transparency, and alignment with existing network automation architectures, enabling consistent translation of operator goals into policies that are interoperable with standard orchestration and management systems in IoT environments.¶
This document uses the terminology defined in [RFC9315], [RFC8329], [I-D.ietf-i2nsf-applicability], [I-D.jeong-nmrg-security-management-automation], and [SPT].¶
In addition, the following terms are defined for the purpose of this document:¶
Intent: A set of operational goals (that a network should meet) and outcomes (that a network is supposed to deliver), defined in a declarative manner without specifying how to achieve or implement them [RFC9315].¶
Intent-Based Management (IBM): It enforces an intent from a user (or administrator) into a target system. An intent can be expressed as a natural language sentence and translated into a high-level policy using natural language interpretation and structured policy mapping [I-D.jeong-nmrg-security-management-automation], [SPT]. This high-level policy is then transformed into low-level policies that are dispatched to appropriate Service Functions (SFs). Based on monitoring feedback, new rules may be generated or existing policies refined.¶
Scenario Extractor: A logical function that receives a natural language input from the user or operator and classifies it along two axes: the management role (e.g., Communication Service Customer, Communication Service Provider, or Network Operator, as defined in 3GPP [TS-28.530]) and the deployment scenario (e.g., RadioNetwork, RadioService, EdgeServiceSupport, or 5GCNetwork, corresponding to the IntentExpectation subclasses defined in 3GPP [TS-28.312]). The output is a coordinate that constrains downstream component behavior.¶
Slot Extractor: A logical function that, in parallel with the Scenario Extractor and given the same natural language input, extracts named entities and structured slot values (such as target name, target value, target unit, and target condition) required to populate the policy document.¶
Intent Composer: A logical function that merges the outputs of the Scenario Extractor and the Slot Extractor into a single structured intermediate representation (typically a JSON document) consumed by the Policy Generator. The Intent Composer is a deterministic, schema-shaped aggregation step and does not itself perform language understanding.¶
Policy Generator: A logical function that produces a machine-readable policy document, typically in a format such as YAML or JSON, from the merged outputs of the Scenario Extractor and the Slot Extractor. The Policy Generator operates under schema-as-grammar constraints that constrain per-token decoding against the target schema, such as that defined in 3GPP [TS-28.312].¶
Policy Validator: A logical function that evaluates a candidate policy document along three dimensions: (i) schema validity against the OpenAPI specification of the target standard, (ii) cross-slot semantic invariants such as the relation between object type and target name, and (iii) semantic faithfulness between the original natural language intent and the candidate policy. The Policy Validator emits a failure-mode trace identifying which dimension(s), if any, were violated.¶
Trace driven recovery agent: A logical function that consumes the failure-mode trace produced by the Policy Validator and dispatches targeted regeneration to the appropriate upstream component, rather than performing generic retry. The trace driven recovery agent supports failure-mode-specific corrective actions, such as regenerating the policy under additional structural constraints when a cross-slot violation is detected.¶
Policy Knowledge Base: A repository that maintains domain-specific knowledge used during translation, including the schema of the target standard, examples of valid policy documents (such as those provided in informative annexes of 3GPP [TS-28.312]), and the relational invariants between schema fields (such as the mapping from object type to the set of valid target names). The Policy Knowledge Base supports schema-as-grammar compilation, few-shot retrieval, and cross-slot constraint checking.¶
Schema-as-Grammar: A constrained-decoding technique that compiles a target schema (such as an OpenAPI specification or a JSON Schema) into a schema-derived grammar consumed by a language model decoder, so that each token continuation is constrained to keep the partial output extendable to a schema-admissible completion [Outlines][XGrammar][GCD][JSONSchemaBench]. The expressiveness of this grammar depends on the constrained-decoding implementation; not all schema features are expressible as efficient grammars, and post-generation validation is therefore still necessary. Schema-as-grammar may be applied at multiple levels, including the intermediate JSON representation produced by the Extractors and the candidate policy document produced by the Policy Generator.¶
Failure Modes: Four orthogonal categories of failure observed in intent-to-policy translation: (i) F-syn, syntactic invalidity against the schema; (ii) F-sem, semantic mis-grounding such as selection of an invalid schema branch; (iii) F-val, value-range or unit errors in extracted slot values; and (iv) F-xs, cross-slot inconsistency in which individually valid fields combine to violate a relational invariant. Each failure mode is primarily detected by a designated component of the Policy Validator, though some categories (notably F-val) may be observed by more than one sub-component depending on whether the violation is expressible at the schema level or only with respect to the natural language context.¶
Degraded Intent: An intent translation result that has been flagged as low-confidence because one or more failure modes could not be resolved within the configured retry budget of the trace driven recovery agent. A degraded intent may still result in policy generation, but with warnings or limited scope, and is suitable for routing to a human operator or to a validation pipeline before deployment.¶
This section defines the architecture of the Intent Translator Framework, which is designed to convert high-level, natural language intents into machine-readable policy representations in structured formats such as YAML. The framework enables intent-based management automation for IoT environments and aligns with policy modeling and lifecycle procedures defined in [TS-28.312].¶
The Intent Translator is a modular subsystem responsible for converting natural language intent into a structured, machine-readable policy document suitable for enforcement in intent-based management systems. It forms the core of the intent translation framework, providing parallel extraction, schema-constrained generation, multi-dimensional validation, and trace-based adaptive retry. The final output is expressed in a structured format such as YAML and adheres to the policy modeling defined in [TS-28.312].¶
Architecturally, the Intent Translator operates as a partially parallel pipeline composed of four functional components, a deterministic merge step (the Intent Composer), and a feedback router (the trace driven recovery agent). The two Extractors execute in parallel on the same input; their outputs are merged by the Intent Composer and consumed by the Policy Generator. The Policy Validator then evaluates the candidate policy along three independent dimensions, and the trace driven recovery agent uses the resulting failure-mode trace to dispatch targeted regeneration when needed. The pipeline supports schema-grounded extraction, schema-as-grammar generation, failure-mode-orthogonal validation, and adaptive retry. It is designed to support transparent, extensible, and standards-aligned translation of human goals into actionable configurations.¶
+----------+
| IBN User |
+----------+
|
| natural language intent
v
+--------------------------------------------------------------+
| Intent Translator |
| |
| +---------------------+ +---------------------+ |
| | Scenario Extractor | | Slot Extractor | |
| +---------------------+ +---------------------+ |
| | | |
| | (parallel inference) | |
| +-------------+--------------+ |
| | |
| v |
| +---------------------+ |
| | Intent Composer | |
| +---------------------+ |
| | |
| v |
| +---------------------+ +----------------+ |
| | Policy Generator |<-| Policy | |
| +---------------------+ | Knowledeg Base | |
| | +----------------+ |
| v |
| +---------------------+ |
| | Policy Validator | |
| +---------------------+ |
| | |
| pass | fail (with trace) |
| +------------+------------+ |
| | v |
| | +-------------------+ |
| | | Trace driven | |
| | | recovery agent | |
| | +-------------------+ |
| | | |
| | v |
| | targeted retry |
+---------------|----------------------------------------------+
v
Validated YAML
policy document
The main components of the Intent Translator (Scenario Extractor, Slot Extractor, Intent Composer, Policy Generator, Policy Validator, and trace driven recovery agent) are illustrated in Figure 1.¶
Scenario Extractor: A component that classifies the input intent into a structural coordinate. Given a natural language intent, the Scenario Extractor produces a pair (role, scenario), where role denotes the 3GPP management role - Communication Service Customer (CSC), Communication Service Provider (CSP), or Network Operator (NOP), as defined in [TS-28.530] - and scenario denotes the IntentExpectation subclass defined in [TS-28.312] (RadioNetwork, RadioService, EdgeServiceSupport, or 5GCNetwork). The resulting 3 by 4 coordinate space partitions the intent space into twelve cells, each of which constrains the set of valid downstream policy choices. The Scenario Extractor is typically realized as a language model under schema-as-grammar constraints that admit only the twelve valid (role, scenario) combinations.¶
Slot Extractor: A component that, in parallel with the Scenario Extractor and given the same natural language input, extracts named entities (such as area codes, user groups, or service identifiers) and structured slot values required to populate the policy document. Typical slots include target name, target value, target unit, and target condition. The Slot Extractor is also realized under schema-as-grammar constraints, so that entity types and slot enumerations (such as units and comparison conditions) are restricted to valid values at decoding time.¶
Intent Composer: A component that merges the outputs of the two Extractors into a single structured intermediate representation (the Intermediate JSON) that the Policy Generator consumes. The Intent Composer performs a deterministic, schema-shaped aggregation - it does not itself perform language understanding.¶
Policy Generator: A component that synthesizes a candidate policy document. It consumes the merged Intermediate JSON produced by the two Extractors and emits a candidate policy document, typically in YAML, that targets the schema defined in [TS-28.312]. The Policy Generator operates under schema-as-grammar constraints derived from the target OpenAPI specification, limiting token continuations to those admitted by the compiled grammar. Post-generation validation remains necessary because not all semantic or cross-slot constraints are expressible in the generation grammar. Optionally, the Policy Generator may be specialized to the target domain through supervised adaptation, for example by parameter-efficient fine-tuning over a corpus of intent-policy pairs.¶
Policy Validator: A component that evaluates the candidate policy along three independent dimensions and emits a failure-mode trace. The three sub-components are described in Section 3.4. Unlike a single pass/fail check, the failure-mode trace identifies which structural or semantic invariant was violated, enabling the trace driven recovery agent to take a targeted corrective action.¶
Trace driven recovery agent: A component that consumes the failure-mode trace from the Policy Validator and dispatches targeted regeneration. The router supports failure-mode-specific corrective actions, such as regenerating the policy under additional structural constraints when a cross-slot violation is detected, or re-extracting slot values when a value-range violation is detected. The router enforces a bounded retry budget and emits a degraded intent if the budget is exhausted without successful validation.¶
Policy Knowledge Base: A repository component that supplies domain knowledge consumed by the other components. It maintains the schema of the target standard (used by the Policy Generator for schema-as-grammar compilation), examples of valid policy documents (used for few-shot retrieval), and the relational invariants between schema fields (used by the Policy Validator for cross-slot consistency checking). The Policy Knowledge Base may be extended over time as new schema versions and new examples become available.¶
Together, these components support a transparent transformation of user-defined goals into system-aligned candidate policies that can be validated before downstream use. The architecture is modular and extensible, allowing domain-specific enhancements (such as substitution of the underlying language model, the constrained decoder, or the validator implementation) without modification to the end-to-end pipeline.¶
The two Extractors share the same natural language input but address cognitively distinct sub-tasks. The Scenario Extractor performs abstraction-level reasoning and taxonomy classification, determining how the intent maps to a coordinate in the role-scenario space. The Slot Extractor performs token-level pattern matching and schema-aware slot filling, identifying entity spans and structured values in the surface text. Decomposing these sub-tasks into two parallel inferences reduces the attention dispersion that is known to degrade multi-task prompting, and permits each inference to be constrained by a tighter schema-as-grammar specification.¶
Natural Language Intent
|
+-------------+-------------+
| |
v v
+--------------------+ +--------------------+
| Scenario Extractor | | Slot Extractor |
+--------------------+ +--------------------+
| |
v v
{role, scenario} {entities, slot values}
| |
+-------------+-------------+
|
v
+-------------------+
| Intent Composer |
+-------------------+
|
v
Policy Generator
The internal flow of the parallel extraction step is illustrated in Figure 2.¶
Scenario Extractor: A logical function that selects one of the three 3GPP management roles (CSC, CSP, NOP) and one of the four IntentExpectation subclasses (RadioNetwork, RadioService, EdgeServiceSupport, 5GCNetwork). The product space of three roles and four scenarios admits exactly twelve valid combinations, and the Scenario Extractor is constrained at decoding time so that only one of these twelve combinations can be emitted. The output is a small JSON object that records the chosen (role, scenario) pair.¶
Slot Extractor: A logical function that, in parallel with the Scenario Extractor and from the same natural language input, identifies the named entities (such as area codes, user groups, or service identifiers) and the structured slot values (target name, target value, target unit, target condition) that the policy will carry. Slot values are constrained at decoding time to belong to valid enumerations (for example, a closed set of comparison conditions and a closed set of units), so that downstream schema validation cannot fail on out-of-vocabulary slots.¶
Intent Composer: A deterministic step that merges the two Extractor outputs into a single Intermediate JSON document of the form {role, scenario, entities, slot values}. The Intent Composer does not invoke a language model. The two Extractors operate on the same input independently, so any cross-output inconsistency that may arise is left to the Policy Validator to detect downstream.¶
The two Extractors may share the underlying language model instance, differing only in their prompt and in the schema-as-grammar specification applied at decoding time. This sharing can keep the number of distinct model artifacts low and reduce the operational complexity of maintaining heterogeneous model families. The two inferences are independent, so they may be executed either sequentially on a single accelerator or concurrently when batched inference is supported by the runtime.¶
Parallel decomposition can be preferable to sequential decomposition (in which the output of the Scenario Extractor is injected as context to the Slot Extractor) for two reasons. First, parallel execution can reduce cascading errors from the Scenario Extractor into the Slot Extractor. Second, the two outputs may be cross-checked downstream, providing an additional consistency signal to the Policy Validator and the trace driven recovery agent.¶
The Policy Generator synthesizes a candidate policy document from the merged Intermediate JSON. The principal design constraint is that candidate output should remain within the structural language admitted by the target OpenAPI-derived schema grammar. This constraint is enforced through schema-as-grammar [Outlines][XGrammar][GCD], in which the schema is compiled into a schema-derived grammar consumed by the language model decoder. The general efficacy and known limitations of schema-as-grammar across heterogeneous schemas have been characterized in recent benchmarks [JSONSchemaBench]; not all schema features are expressible as efficient grammars, which is one reason post-generation validation remains part of the framework.¶
+---------------------+
| Intent Composer |
+----------+----------+
|
| Intermediate representation
v
+-----------------------------+
| Policy Generator |
| |
| +--------------------+ | +----------------+
| | Grammar Compiler |<---|---| Policy |
| +--------------------+ | | Knowledge Base |
| | | +--------=-------+
| v |
| +---------------------+ |
| | Constrained Decoder | |
| +---------------------+ |
+--------------+--------------+
|
| Candidate policy representation
v
Policy Validator
The internal workflow of the Policy Generator is illustrated in Figure 3.¶
Grammar Compiler: A component that compiles the target schema (such as the OpenAPI specification of [TS-28.312]) into a schema-derived grammar suitable for token-by-token constrained decoding. The Grammar Compiler reads the schema from the Policy Knowledge Base. For schemas that employ OpenAPI polymorphism keywords such as discriminator or allOf, a preprocessing step that flattens these constructs into a single oneOf form may be required before grammar compilation, depending on the capabilities of the chosen constrained decoder.¶
Constrained Decoder: A component that runs the language model with the compiled grammar applied at every decoding step. At each step, the grammar restricts the set of token continuations to those that keep the partial output extendable to a schema-admissible completion. The Constrained Decoder consumes the Intermediate JSON produced by the Intent Composer and emits the candidate policy document.¶
Schema-as-grammar enforcement reduces syntactic invalidity (F-syn) by constraining the output language, but it does not, by itself, establish semantic coherence across slots. For example, a candidate document may satisfy every individual field constraint while combining an object type and a target name that are incompatible under the IntentExpectation type hierarchy of [TS-28.312]. Such cross-slot violations are detected downstream by the Policy Validator.¶
The Policy Generator may optionally be specialized to the target domain through supervised adaptation. Parameter-efficient fine-tuning techniques such as Low-Rank Adaptation (LoRA) [LoRA] permit specialization with a small number of trainable parameters and a modest corpus of intent-policy pairs. Domain specialization reduces residual biases inherited from general-purpose pretraining, in particular the tendency to default to the most frequent object type in the training distribution regardless of the input scenario.¶
The Policy Validator evaluates the candidate policy document along three independent dimensions, each implemented as a distinct sub-component. The three dimensions are chosen to partition the space of observed failure modes, so that every detected failure can be mapped to a specific sub-component and therefore to a specific corrective action.¶
+---------------------+
| Policy Generator |
+----------+----------+
|
| candidate policy
v
+-----------------------------------------+
| Policy Validator |
| |
| +-------------------------------+ |
| | Schema Validator | |
| | (schema shape) | |
| +---------------+---------------+ |
| | |
| v |
| +-------------------------------+ |
| | Semantic Solver | |
| | (cross-slot) | |
| +---------------+---------------+ |
| | |
| v |
| +-------------------------------+ |
| | Semantic Judge | |
| | (intent faithfulness) | |
| +---------------+---------------+ |
| | |
+--------------------+--------------------+
|
v
{ pass | failure trace }
|
+---------+---------+
| |
pass | | fail + trace
| v
| +----------------+
| | Trace driven |
| | recovery agent |
v +----------------+
Validated policy
The internal architecture of the Policy Validator is shown in Figure 4. The three sub-components are executed in order, and each emits a pass/fail flag together with a structured trace identifying what failed. The aggregated result determines whether the candidate policy is released downstream or returned to the trace driven recovery agent for targeted retry.¶
Schema Validator (syntax check): This sub-component checks the candidate policy document against the OpenAPI specification of the target standard, using a standard JSON Schema validator such as a Draft 2020-12 implementation [JSON-Schema-2020-12]. It detects syntactic invalidity (F-syn) and a portion of value-range errors (F-val) that are expressible at the schema level (such as missing required fields or out-of-range numeric values). When schema-as-grammar is applied at generation time, the Schema Validator serves primarily as a post-hoc confirmation rather than as the principal defense against F-syn.¶
Semantic Solver (cross-slot check): This sub-component checks cross-slot relational invariants that are not expressible at the schema level. The principal invariant is the relation between object type and target name: every IntentExpectation subclass defined in [TS-28.312] admits only a specific set of target names, and the combination must respect this constraint. The Semantic Solver encodes the valid combinations as a relational invariant (for example, as a Boolean satisfiability problem decided by a Satisfiability Modulo Theories (SMT) solver such as Z3 [Z3]) and detects cross-slot inconsistency (F-xs).¶
Semantic Judge (meaning check): This sub-component evaluates the semantic faithfulness between the original natural language intent and the candidate policy document. It detects semantic mis-grounding (F-sem), such as the selection of a schema branch that is structurally valid but does not match the user's stated goal, and the portion of value-range errors (F-val) that depend on natural language context. The Semantic Judge may be realized as a language model judge with calibrated few-shot examples, optionally supplemented by deterministic lexical overlap checks for robustness.¶
The labels F-syn, F-xs, F-sem, and F-val correspond to the four failure-mode categories defined in Section 2. The mapping associates each failure-mode category with its primary detecting sub-component: the Schema Validator emits F-syn and the schema-expressible portion of F-val; the Semantic Solver emits F-xs; and the Semantic Judge emits F-sem and the natural-language-context-dependent portion of F-val. F-val therefore has two detection paths, reflecting the practical observation that some value-range or unit errors are caught at the schema level while others require natural language context. The failure-mode trace produced by the Policy Validator is consumed by the trace driven recovery agent described in Section 3.5.¶
The three sub-components are combined under an explicit ensemble policy. For example, an implementation may require that the Schema Validator and the Semantic Solver both pass, and additionally that at least one of the Semantic Judge or a deterministic supplementary check passes. The choice of ensemble policy is a deployment decision and should be documented alongside the framework configuration.¶
When the Policy Validator emits a failure-mode trace, the trace driven recovery agent uses the identified failure mode to dispatch a targeted corrective action rather than performing generic retry.¶
The trace driven recovery agent enforces a bounded retry budget. When the budget is exhausted without successful validation, the router emits a degraded intent that records the residual failure mode and the most recent candidate policy.¶
The routing policy itself is subject to validation. A deployment should verify that a selected retry target is likely to reduce the observed failure mode and should update the routing table if local data indicates a different dominant cause.¶
The intent and high-level policy artifacts produced by the Intent Translator Framework can be expressed using structured representations such as XML data models [RFC6020][RFC7950], JSON, or YAML [YAML]. These documents can be delivered to the appropriate management or orchestration systems via NETCONF [RFC6241], RESTCONF [RFC8040], or REST [REST] interfaces for deployment and enforcement. When the target standard is 3GPP [TS-28.312], the canonical schema is the OpenAPI specification published by 3GPP, and the candidate policy document is validated against this specification by the Schema Validator sub-component.¶
As described in the modular architecture of the framework, user-defined natural language intent is processed through a partially parallel pipeline that includes the Scenario Extractor, the Slot Extractor, the Policy Generator, the Policy Validator, and the trace driven recovery agent. The schema and the cross-slot relational invariants are sourced from the Policy Knowledge Base, enabling schema-as-grammar enforcement and orthogonal failure-mode detection. This design is intended to help translate operational goals - even when imprecisely expressed - into policy representations that can be checked for schema conformance, cross-slot coherence, and semantic faithfulness to the user's intent.¶
Therefore, this document defines a practical and extensible architecture for intent translation in next-generation management systems. Through this architecture, high-level user goals can be mapped to structured policy outputs that are suitable for validation and downstream automation. The framework enables intent-based management to support scalable, knowledge-grounded automation in complex service domains such as IoT, vertical-specific networks, and intelligent edge infrastructures.¶
This document does not require any IANA actions.¶
The deployment of the Intent Translator Framework requires alignment between the Policy Knowledge Base and the operational policies supported by the underlying infrastructure. The schema of the target standard, examples of valid policy documents, and the relational invariants between schema fields must be encoded within the Policy Knowledge Base so that schema-as-grammar enforcement, few-shot retrieval, and cross-slot validation are consistent with the deployment environment.¶
Operators should validate the framework against representative intents and reference policies before enabling full automation. In particular, the routing table of the trace driven recovery agent should be calibrated using local failure traces and operational policy. The default routing policy described in Section 3.5 is a starting point and may need to be adjusted based on deployment data.¶
The computational requirements depend on the selected language models, constrained decoder, and validator implementation. Inference for the two Extractors and the Policy Generator can be served from a small number of accelerators when the underlying language models are of moderate size. The Schema Validator and the Semantic Solver are deterministic and inexpensive. The Semantic Judge, when realized as a language model, dominates the validator's computational cost, and may be replaced or supplemented by deterministic checks in latency-sensitive deployments. When the framework is deployed in a 5G system context [TS-23.501], the resulting policy documents are consumed by the Intent Driven Management Service (IDM-MnS) defined in [TS-28.312].¶
The modular architecture of the framework allows individual components - such as the Scenario Extractor, the Slot Extractor, the Policy Generator, or any sub-component of the Policy Validator - to be adapted to different domains, languages, or knowledge representations. As such, implementers can substitute the language model, modify the schema-as-grammar specification, or replace the output schema (e.g., YAML, XML, JSON) without altering the end-to-end pipeline.¶
The framework is designed to reduce coupling to a specific schema version. The schema-as-grammar specification consumed by the Policy Generator is compiled from the canonical OpenAPI specification of the target release, so that schema evolution between 3GPP releases can be accommodated by recompilation without changes to the pipeline. Forward compatibility with future releases of [TS-28.312] (such as Release 20) is intended through this design choice.¶
The Policy Knowledge Base may be extended over time with new examples, new entity types, and new relational invariants to support evolving service capabilities. Such extensions should preserve backward compatibility by maintaining stable identifiers for core operational concepts.¶
The framework supports degraded intent resolution through the bounded retry budget of the trace driven recovery agent. When the budget is exhausted without successful validation, the framework emits a degraded intent that records the residual failure mode and the most recent candidate policy. While this enables flexible operation in the presence of ambiguous intents or schema evolution, operators should evaluate how degraded intents are handled within their intent lifecycle.¶
For high-assurance environments, degraded intents should be reviewed by a human operator or routed to a validation pipeline before policy deployment. Logging mechanisms should be used to record degraded cases, the residual failure modes, and their resolution outcomes, so that future iterations of the Policy Knowledge Base, the routing table, and any supervised specialization of the Policy Generator can incorporate the observed cases.¶
Because the Semantic Judge has inherent calibration limits, deployments should treat F-sem-only failures with care. In some deployments it may be appropriate to accept the candidate policy when only F-sem is flagged but the Schema Validator and the Semantic Solver both pass, while logging the F-sem warning for later review.¶
The Intent Translation Framework must operate over authenticated and confidential channels (e.g., TLS/HTTPS) to prevent eavesdropping, message tampering, or replay attacks by malicious actors. Implementations should enforce strict certificate validation and regularly rotate cryptographic keys to maintain transport-layer security.¶
Because the system processes free-form natural language intents, it is vulnerable to adversarially crafted inputs designed to produce unintended or harmful policies. Schema-as-grammar enforcement bounds the space of syntactically possible outputs, and the cross-slot Semantic Solver bounds the space of structurally coherent outputs, but neither prevents an adversary from issuing a semantically harmful intent that is nonetheless schema-valid and cross-slot coherent. Deployments should incorporate input validation, semantic sanity checks, and confirmation interfaces for high-impact operations, and should rate-limit or quarantine suspicious requests for manual review.¶
Deployments that use language-model components should also consider prompt-injection and instruction-confusion attacks. Inputs, retrieved examples, and schema descriptions should be separated by clear trust boundaries, and implementations should avoid allowing user-provided text to override validator, authorization, or deployment policies.¶
Policy generation should be bound to an authorization model. A policy that is schema-valid and semantically faithful to an input intent may still exceed the authority of the requesting principal or may have an unacceptable operational blast radius. High-impact candidate policies should therefore be subject to approval, rollback, and audit procedures before enforcement.¶
Intent collisions, in which contradictory or overlapping intents are submitted concurrently, can lead to policy conflicts or enforcement gaps. The framework must include conflict-detection logic that examines the relations between successive policy documents, and either automatically resolves detected collisions using a documented precedence model or escalates them to human operators for arbitration.¶
When the Policy Generator is specialized through supervised adaptation, the training corpus must be protected against poisoning. An adversary that injects malicious intent-policy pairs into the training corpus could bias the Policy Generator toward emitting policies that are schema-valid but operationally harmful. Implementations should record the provenance of each training example and should validate that supervised adaptation does not regress the framework's behavior on a held-out test set of known-good intents.¶
This section is included to provide an indication of implementation status, consistent with [RFC7942]. It does not constitute an endorsement by the IETF or the IRTF, and it is expected to be removed or updated before publication as an RFC.¶
A research prototype of the framework has been exercised using publicly available components: an open-weight language model for the Extractors and Policy Generator, a constrained-decoding engine for schema-derived generation constraints, a JSON Schema validator for schema-level checks, and an SMT solver for selected cross-slot invariants. The prototype used the OpenAPI specification of 3GPP TS 28.312 (as of Release 19) as the target schema source.¶
Preliminary experiments were performed on a small synthesized data set of natural language intents and reference policy representations, derived from the OpenAPI schema via template-based synthesis and augmented by paraphrastic methods. The experiments were used to compare a single-extractor baseline with the parallel-extractor and validation-routing design described in this document. The observations suggest that parallel extraction and cross-slot validation reduce several classes of residual errors, especially cross-slot inconsistency. These results are preliminary and do not constitute a generalization claim; the data set and evaluation harness are not yet sufficient for that purpose.¶
A future revision is expected to identify the prototype repository, the data set generation method, the exact schema version, and the evaluation harness once those artifacts are made publicly available.¶
This work was supported by Institute of Information & Communications Technology Planning & Evaluation (IITP) grant funded by the Korea Ministry of Science and ICT (MSIT) (No. RS-2024-00398199 and RS-2022-II221015).¶
This document has greatly benefited from inputs and discussions within the IRTF Network Management Research Group (NMRG), with contributions from Yong-Geun Hong (Daejeon University) and Joo-Sang Youn (Dong-Eui University). The authors sincerely appreciate their contributions.¶
The following are coauthors of this document:¶