﻿<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE rfc [
  <!ENTITY RFC2119 SYSTEM "https://bib.ietf.org/public/rfc/bibxml/reference.RFC.2119.xml">
  <!ENTITY RFC8174 SYSTEM "https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8174.xml">
  <!ENTITY BCP14 SYSTEM "https://bib.ietf.org/public/rfc/bibxml/reference.BCP.14.xml">
]>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude"
     ipr="trust200902"
     docName="draft-janz-nmrg-ontology-reconciliation-00"
     category="info"
     submissionType="IETF"
     consensus="false"
     xml:lang="en"
     version="3">

  <front>
    <title abbrev="Agent-to-Agent Ontology Reconciliation">Automated Agent-to-Agent Ontology Reconciliation for Cognitive Network Management Systems</title>
    <seriesInfo name="Internet-Draft" value="draft-janz-nmrg-ontology-reconciliation-00"/>

    <author fullname="Chris Janz" initials="C." surname="Janz">
      <organization>Huawei</organization>
      <address>
        <email>christopher.janz@huawei.com</email>
      </address>
    </author>
    <author fullname="Henry Yu" initials="H." surname="Yu">
      <organization>Huawei</organization>
      <address>
        <email>henry.yu1@huawei.com</email>
      </address>
    </author>
    <author fullname="Hesam Rahimi" initials="H." surname="Rahimi">
      <organization>Huawei</organization>
      <address>
        <email>hesam.rahimi@huawei.com</email>
      </address>
    </author>
    <author fullname="Nigel Davis" initials="N." surname="Davis">
      <organization>Ciena</organization>
      <address>
        <email>ndavis@ciena.com</email>
      </address>
    </author>
    <author fullname="Diego López" initials="D." surname="López">
      <organization>Telefónica</organization>
      <address>
        <email>diego.r.lopez@telefonica.com</email>
      </address>
    </author>

    <date year="2026" month="June" day="10"/>

    <workgroup>Network Management Research Group</workgroup>

    <keyword>ontology</keyword>
    <keyword>ontology mediation</keyword>
    <keyword>large language models</keyword>
    <keyword>agentic AI</keyword>
    <keyword>cognitive network management</keyword>
    <keyword>data model translation</keyword>

    <abstract>
      <t>This document describes a possible direction for inter-system
      communication in network management, in which two cognitive software
      agents establish between themselves the basis for exchanging information,
      without depending on a single rigid data model agreed by their
      implementers in advance. The agents bring relevant knowledge, can extend
      it through learning, can reason, and can converse in natural language. The
      approach is framed as a workflow in which each agent makes explicit the
      ontology implicit in its data model, the two agents address their
      differences through conversation, and a translator artefact is produced
      that is then used during ordinary operation. A central property is that
      language-model inference is consumed during the agents' conversation
      rather than on each subsequent message. The document situates the
      direction relative to adjacent work and illustrates it through three use
      cases drawn from network management.</t>
    </abstract>
  </front>

  <middle>

    <section anchor="intro" numbered="true">
      <name>Introduction</name>
      <t>Inter-system communication in network management is, today,
      predominantly arranged through shared data models: where systems
      implement the same model, or compatible profiles of it, the exchange is
      straightforward, and where they do not, the integration is engineered.
      Engineering the bridge between two data models is a substantial,
      recurring cost. Standard models do not anticipate every measurement
      source, every vendor extension, every operational subtlety; new sources
      need to be integrated as deployments evolve; occasional transactions need
      information at an abstraction level different from that of the ongoing
      conversation.</t>

      <t>The arrival of large language models, together with the broader move
      toward agentic software architectures, makes a different option
      conceivable. A software system that holds relevant knowledge, can extend
      it, can reason, and can converse in natural language is in principle able
      to do for itself - in dialogue with a peer that has the same capabilities
      - much of the bridging work that integrators do today. This document
      explores that direction. It describes a workflow under which two such
      systems might construct, between themselves, a translator that runs
      deterministically thereafter, and gives three illustrations of how the
      workflow might apply in network management. Pitfalls and considerations
      for implementation are collected in <xref target="pitfalls"/>.</t>
    </section>

    <section anchor="conventions" numbered="true">
      <name>Conventions and Definitions</name>
      <t>The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
      "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
      "OPTIONAL" in this document are to be interpreted as described in BCP 14
      <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when,
      they appear in all capitals, as shown here.</t>

      <t>The following terms are used:</t>

      <dl newline="true">
        <dt>Cognitive Agent:</dt>
        <dd>an autonomous software entity built around a Large Language Model
        and one or more controlled stores of knowledge, with the ability to
        extend its knowledge through learning, to reason about what it has been
        presented with, and to communicate in natural language.</dd>

        <dt>Ontology:</dt>
        <dd>an explicit account of what a domain admits as entities and of the
        relationships among them.</dd>

        <dt>Data Model:</dt>
        <dd>a syntactic and structural artefact - for example a YANG module or
        a JSON Schema - that carries an ontology implicitly through the
        structures it prescribes.</dd>

        <dt>Ontology Mediation:</dt>
        <dd>the activity of bridging two ontologies so that information
        expressed under one is intelligible under the other; comprises
        alignment (correspondence discovery), mapping (expressing
        correspondences as transformation rules), and merging (combining two
        ontologies into one, where appropriate).</dd>

        <dt>Translator:</dt>
        <dd>executable code or a set of declarative rules applied at the
        boundary between two systems that converts instances expressed under
        one data model into instances expressed under another; produced from a
        mediation and run deterministically thereafter.</dd>

        <dt>Variable Abstraction:</dt>
        <dd>the operational practice of presenting information at the level of
        detail appropriate to a particular interaction <xref target="ETSI-ZSM-019"/>.</dd>
      </dl>
    </section>

    <section anchor="background" numbered="true">
      <name>Background</name>
      <t>Communication between two systems depends on three things being
      sufficiently aligned: the ontologies that determine what each can talk
      about, the semantics that govern what particular utterances mean, and the
      syntactic conventions that govern how those utterances are expressed.
      Standard data models are an attempt to settle all three by agreement, in
      advance of any specific exchange. Where the agreement is complete, no
      further work is needed at exchange time. Where it is not, the residual
      gaps need to be closed by other means. Network management offers many
      reasons why complete prior agreement is not always available: deployments
      evolve; vendor extensions accumulate; different communities settle on
      different conventions for the same operational territory.</t>

      <t>A further consideration is that the appropriate level of abstraction
      depends on the purpose of an exchange. Two systems may communicate at a
      high level of abstraction for ordinary purposes and need a more detailed
      view for an audit or a diagnostic question. The operational practice of
      presenting information at the abstraction appropriate to a given
      interaction is known as Variable Abstraction Management
      <xref target="ETSI-ZSM-019"/>, and it implies that no single fixed model
      is uniformly appropriate even between the same two systems.</t>

      <t>It is also worth recognising that some differences between ontologies
      are not bridgeable by any amount of description. Where one party has
      concepts the other has no basis for, no quantity of explanation will
      install them. A workflow of the kind discussed here MUST be able to
      acknowledge such a case and report it, rather than fabricate a
      correspondence.</t>
    </section>

    <section anchor="problem" numbered="true">
      <name>Problem Statement</name>
      <t>Two systems are required to communicate for some purpose, but the data
      models they implement do not, between them, cover the matter
      unambiguously. The common situations are two: each system implements a
      recognisable standard model with partial overlap to the other, or the
      relationship between the two models is more ad-hoc. The customary response
      - hand-engineered translation logic, often with tool support - is
      expensive to produce and expensive to maintain across the evolution of
      the models. The direction explored in this document is whether two
      systems with the cognitive capabilities described in
      <xref target="conventions"/> can construct that translation between
      themselves, calling on human expertise only where they cannot make
      further progress on their own.</t>
    </section>

    <section anchor="workflow" numbered="true">
      <name>A Reconciliation Workflow</name>

      <section anchor="workflow-conversation" numbered="true">
        <name>The Conversation</name>
        <t>The workflow described here treats reconciliation as an iterative
        conversation between two cognitive agents, each acting on behalf of one
        of the communicating systems. At each iteration, the agents attempt to
        interpret material they have been presented with - a data-model
        instance, an ontology fragment, a description in natural language -
        against the knowledge each already holds. Where an interpretation is
        partial, the agents request and supply further information; the
        exchange can take a variety of forms, including natural-language
        description, examples and counter-examples, references to standards or
        to documentation that both agents can consult, structural sketches, and
        questions put to a human expert. When the two agents have a sufficient
        working understanding of one another's representation, each proposes the
        correspondences it will use to translate between the two and validates
        those proposals against representative cases. Where a translation, once
        exercised against later material, exposes a difference that the original
        conversation did not anticipate, the agents can return to the
        conversation and refine the artefact. In this sense the translator
        produced by the workflow is maintained rather than delivered.</t>

        <t>Implementations SHOULD make this iteration explicit, both to enable
        principled re-engagement and to support audit of the decisions made
        during the conversation.</t>
      </section>

      <section anchor="workflow-differences" numbered="true">
        <name>Kinds of Difference, and Self-Extension</name>
        <t>Differences encountered between two ontologies fall into three
        textures that admit different treatments. Where both parties recognise
        a concept but name it differently, the resolution is a dictionary entry
        between the two names. Where both parties recognise a concept but one
        represents it more finely than the other, the resolution is for the
        finer party to convey the distinctions the exchange actually needs;
        pursuing distinctions beyond what the exchange needs is wasted effort.
        Where one party has an element with no counterpart on the other side,
        the treatment is more delicate. Three responses are available, and they
        are not equally good. The deficient side may refuse to accept the
        concept, which forces the peer to lose information that may be essential
        to its purposes. It may escalate to a human, which - if applied to every
        such case - undermines the value of automating the workflow in the first
        place. Or it may extend its own ontology, auditably, to host the foreign
        concept. This last option, which this document refers to as
        self-extension, is the response a reconciliation workflow SHOULD prefer
        where the available descriptions support it, with escalation reserved
        for cases in which no description suffices.</t>
      </section>

      <section anchor="workflow-lmg" numbered="true">
        <name>Lift, Mediate, Generate</name>
        <t><xref target="fig-workflow"/> summarises the workflow. Each side
        begins with its data model and makes the ontology that the model carries
        explicit; the two agents mediate the differences by the conversational
        mechanism of <xref target="workflow-conversation"/>; and each side then
        generates the translator that will be used during ordinary operation. A
        useful property of this arrangement is that the language-model inference
        - the expensive part - is invoked during the conversation, not during
        ordinary message exchange. The translator runs deterministically
        thereafter, with the operational characteristics of conventional
        interface code. When the model on either side evolves, or when the
        translator begins to encounter instances it cannot handle cleanly, the
        workflow can be re-entered and the artefact refreshed; implementations
        SHOULD provide explicit triggers for this re-entry.</t>

        <figure anchor="fig-workflow">
          <name>The reconciliation workflow.</name>
          <artwork type="ascii-art"><![CDATA[
    +-----------------+              +-----------------+
    |  Data Model A   |              |  Data Model B   |
    +--------+--------+              +--------+--------+
             |                                |
             | make ontology         make     |
             | explicit              ontology |
             |                       explicit |
             v                                v
    +-----------------+              +-----------------+
    |   Ontology A    |              |   Ontology B    |
    +--------+--------+              +--------+--------+
             |                                |
             |     <-- conversation -->       |
             |   (description, examples,      |
             |    references, expert input)   |
             v                                v
    +-----------------------------------------------+
    |   Agreed correspondences + decision record    |
    +-----------------------+-----------------------+
                            |
                            | generate
                            v
    +-----------------------------------------------+
    |   Translator A <-> B (deterministic)          |
    +-----------------------+-----------------------+
                            |
                            v
    +-----------------------------------------------+
    |   Ordinary operation (no further              |
    |   language-model inference per message)       |
    +-----------------------------------------------+
]]></artwork>
        </figure>
      </section>
    </section>

    <section anchor="related" numbered="true">
      <name>Related Work</name>
      <t>The workflow described above touches several adjacent lines of
      research and engineering. Ontology mediation has a long-standing
      literature, with tools such as PROMPT <xref target="PROMPT"/> and MAFRA
      <xref target="MAFRA"/> and algorithms such as GLUE <xref target="GLUE"/>
      and S-Match <xref target="SMATCH"/>, evaluated through the Ontology
      Alignment Evaluation Initiative <xref target="OAEI"/> using matchers
      including LogMap <xref target="LOGMAP"/> and AgreementMakerLight
      <xref target="AML"/>. This body of work has historically targeted large,
      published ontologies (biomedical references most prominently), and it
      routes the harder disambiguation decisions to a human reviewer; the
      present document is concerned with situations in which the ontologies are
      smaller and more locally scoped, and in which the decisions that classical
      tools route to a human are instead handled by the cognitive agents
      themselves.</t>

      <t>Since 2023, large language models have been incorporated into ontology
      matchers in several ways - as one-shot oracles on candidate
      correspondences <xref target="NORO2023"/> <xref target="HE2023"/>, as
      components inside conventional pipelines <xref target="LLMS4OM"/>
      <xref target="LLMORACLE"/>, and through generation of textual definitions
      that are then embedded and compared <xref target="GENOM"/>. Agent-OM
      <xref target="AGENTOM"/> arranges the matcher itself as two cooperating
      LLM-driven agents, though those agents remain roles within a single
      matching system whose inputs and outputs are ontologies and alignments
      rather than communicating systems and translators.</t>

      <t>The idea of agents negotiating ontologies through dialogue is older
      still: Bailin and Truszkowski <xref target="BAILIN2001"/>
      <xref target="BAILIN2002"/> and van Diggelen and colleagues
      <xref target="VDIGGELEN"/> set out the shape of such negotiation when the
      cognitive substrate available was much thinner than today's
      large-language-model-equipped agents can offer. Two recent contributions -
      Gateway-X <xref target="GATEWAYX"/>, building on earlier work
      <xref target="PAHL2014"/> <xref target="VSL2019"/>, and AICEP
      <xref target="AICEP"/> - place language-model inference on the runtime
      data path, translating or grounding on each call. The workflow described
      here is not in opposition to either of those lines; where two large
      published ontologies must be aligned at scale, the classical matchers are
      more apt, and where genuinely unanticipated instances must be handled at
      the moment they arrive, runtime translation is an appropriate complement
      to a negotiated translator.</t>
    </section>

    <section anchor="usecases" numbered="true">
      <name>Illustrative Use Cases</name>
      <t>Three situations from network management practice illustrate where the
      workflow of <xref target="workflow"/> might be applied. None of them is
      presented as a worked engineering case; each is a sketch of how the
      workflow could be used.</t>

      <section anchor="uc-newsource" numbered="true">
        <name>A New Source Joining a Knowledge Graph</name>
        <t>A management system that organises its working knowledge as a graph
        of entities and relationships needs, from time to time, to integrate a
        new source of evidence - a measurement instrument, an analytic engine,
        or a derived signal feed - into that graph. Today, such integrations are
        typically engineered. The workflow of <xref target="workflow"/> suggests
        an alternative, in which the new source presents itself in natural
        language against a loose convention for describing what an evidence
        source has to offer (what is observed, on which entities, with what
        triggers, in what units, with what accuracy and how fresh). A cognitive
        agent acting on behalf of the management system - here called the
        Gateway - interprets that presentation against the current graph,
        identifying whether the kind of evidence is one the system already
        understands. If it is, the new source is registered as a further
        instance of a known kind, and no further interpretive work is needed. If
        the kind is new, the Gateway poses clarifying questions appropriate to
        what has been advertised, receives natural-language answers, and commits,
        in a single atomic step, both the augmentation of the graph's schema and
        the registration of the source. An acknowledgement closes the exchange,
        and the data subscription begins.</t>

        <t>Two properties of this arrangement are worth noting. First, the
        consequential work happens once per kind of evidence, not once per
        source: adding a second source of an already-understood kind is a
        routine registration, whereas adding the first source of a new kind
        requires interpretation. Second, every onboarding leaves an auditable
        trace - the presentation, any clarifying exchange, the schema change
        committed, and the registration - that can be inspected after the fact
        and, if a later observation casts doubt on the interpretation,
        revisited.</t>

        <t><xref target="fig-onboarding"/> sketches the message exchange. It is
        not intended as a protocol specification.</t>

        <figure anchor="fig-onboarding">
          <name>A possible exchange for onboarding a new source. Clarifying questions are needed only when the kind of evidence is new.</name>
          <artwork type="ascii-art"><![CDATA[
    New source                              Gateway
        |                                       |
        |  natural-language self-presentation   |
        |-------------------------------------->|
        |                                       |
        |    (interpret against current graph)  |
        |                                       |
        |  clarifying questions   (only when    |
        |<------------------       the kind     |
        |  answers          ----    is new)     |
        |-------------------------------------->|
        |                                       |
        |    (commit: schema augmentation if    |
        |     needed, registration, binding)    |
        |                                       |
        |<------------ acknowledgement ---------|
        |                                       |
        |  data follows                         |
        |-------------------------------------->|
]]></artwork>
        </figure>
      </section>

      <section anchor="uc-twomodels" numbered="true">
        <name>Two Data Models, Independently Designed</name>
        <t>The second illustration is the more general one. Two systems hold
        data models for roughly the same operational territory but designed
        independently, and they need to be made to communicate. The workflow of
        <xref target="workflow"/> would, in outline, have each agent first make
        explicit the ontology carried by its model, then engage in conversation
        to address the differences, and finally generate the translator that
        runs at its side of the boundary.</t>

        <t>To make the discussion concrete, the optical-transport domain offers
        two well-known YANG models in this shape: ONF TAPI <xref target="TAPI"/>
        on one side and the IETF TEAS family on the other, with
        <xref target="RFC8795"/> over the network base <xref target="RFC8345"/>,
        extended for optical transport by
        <xref target="I-D.ietf-ccamp-otn-topo-yang"/> and
        <xref target="I-D.ietf-ccamp-layer1-types"/>. Both describe nodes,
        links, termination points, layering, switching, and services, in YANG,
        but each cuts the same operational reality in its own way. The TAPI and
        TEAS models are named here purely for illustration; the points that
        follow are intended to apply to two-data-model reconciliation in
        general.</t>

        <t>Several kinds of difference can be expected to arise. Some are
        matters of terminology - the same concept named differently in the two
        models, often recognisable as cognates. Some are matters of identity -
        one model naming elements through flat identifiers, the other through
        hierarchical ones - which the workflow can accommodate by recording a
        bijection between identity spaces that the translator subsequently
        applies. Some are matters of granularity - one model resolving a concept
        more finely than the other - which the workflow addresses by having the
        finer side convey the distinctions the exchange actually requires.</t>

        <t>Of greater interest are differences in how the same reality is
        decomposed. In the illustrative pair, TAPI represents the transport
        network as one multi-layer topology, with layer information attached to
        the termination points; the TEAS family represents the same reality as
        separate networks per layer, linked by supporting-network references.
        The workflow would, at this point, have to settle a structural
        translation that explodes one shape into the other and collapses back
        again, with the correspondences validated against worked instances
        before the translator is generated. Such a structural negotiation is the
        part of the workflow that would benefit most from explicit human
        attention during mediation.</t>

        <t>Of greatest interest are differences of scope: elements that one
        model represents and the other has no native place for. In the
        illustrative pair, IETF's TunnelTerminationPoint and TAPI's
        ServiceInterfacePoint are examples of concepts that have no direct
        counterpart on the other side. <xref target="workflow-differences"/>
        indicated that the workflow's preferred response to such cases is
        self-extension by the deficient side - extending its own ontology,
        auditably, to host the foreign concept - with escalation reserved for
        concepts that no description can install. Whether a particular case
        admits self-extension is a judgement the agents make in the moment, on
        the basis of the descriptions available to them; not every concept can
        be installed in this way, and the workflow is required to recognise when
        it cannot.</t>

        <t>Whether reconciliation by this workflow would succeed in any
        particular two-model case depends on properties of the models, on the
        knowledge the participating agents can bring to bear, and on the amount
        and quality of expert attention during mediation. This document does not
        claim that every such reconciliation can be completed without human
        intervention. Its claim is that the workflow is a direction worth
        exploring, that the kinds of difference encountered are bounded and
        broadly understood, and that the artefact produced - a deterministic
        translator generated once and then run - has the operational properties
        an IETF audience would expect of interface code.</t>
      </section>

      <section anchor="uc-abstraction" numbered="true">
        <name>A Punctual Shift in Abstraction</name>
        <t>The third illustration extends the second. Two systems have already
        established a working translation at one level of abstraction - say,
        intent-based service provisioning, where the consumer states what it
        wants and the provider satisfies the intent without exposing the
        resources used. On occasion, one side puts a question that the
        established translation cannot answer: an audit, for example,
        demonstrating that the resources carrying a service lie inside (or
        outside) a particular geographic region <xref target="ETSI-ZSM-019"/>.
        The question requires information that the established mediation does not
        represent.</t>

        <t>A punctual application of the same workflow can address the
        situation: the agents extend the established vocabulary just far enough
        to support the response, produce the response under the extended
        vocabulary, and either retire the extension at the close of the
        transaction or retain it if further questions of the same kind are
        anticipated. In many cases this extension is asymmetric: where the
        response is intended for consumption by a human operator on the
        requesting side, the requesting system need not extend its own ontology
        at all; it receives the response as content, and the human consumes it
        directly. The responding system extends, produces, and then retires (or
        retains) the extension on its side alone.</t>
      </section>
    </section>

    <section anchor="pitfalls" numbered="true">
      <name>Pitfalls and Considerations for Implementation</name>
      <t>Several considerations should inform any implementation that pursues
      the direction described above.</t>

      <ul spacing="normal">
        <li>A correspondence committed with high confidence but incorrect is
        more damaging than a flagged uncertainty. Implementations SHOULD surface
        uncertainty early and preserve the basis on which a decision was made,
        so that later review is possible.</li>

        <li>Agreement on what a term means does not, in itself, settle how the
        term is used in operation. Implementations SHOULD consider behaviour in
        addition to denotation, and validation SHOULD include exercise of the
        translated message in its consuming context.</li>

        <li>The depth of mediation should be governed by the purpose of the
        exchange. Pursuing parity for its own sake will spend effort that the
        exchange does not need.</li>

        <li>Some differences are not bridgeable by description. The workflow
        MUST be capable of recognising and reporting such cases.</li>

        <li>Engagement with human expertise SHOULD be designed - the route to
        the expert, the form of the question, the way the answer flows back into
        the agents' knowledge. Ad-hoc escalation is unlikely to age well.</li>

        <li>Every decision committed during a mediation SHOULD be traceable to
        the evidence that produced it. Building provenance in from the start is
        materially less costly than adding it after operational stress.</li>

        <li>The workflow assumes both sides are cognitive in the sense of
        <xref target="conventions"/>. Where one side is a non-cognitive legacy
        system emitting only strict instances, the cognitive side has to do the
        work unilaterally, drawing what it can from the instances and from
        accessible documentation.</li>
      </ul>
    </section>

    <section anchor="security" numbered="true">
      <name>Security Considerations</name>
      <t>The workflow introduces security considerations beyond those of
      conventional model-driven exchange. The natural-language descriptions and
      worked examples exchanged during mediation are inputs to the agents'
      knowledge, and an adversary in a position to influence those inputs could
      attempt to mislead the resulting translator. Implementations SHOULD attach
      provenance and confidence to incoming descriptions and SHOULD support
      revocation of integrations whose origin is later found untrustworthy. Any
      decision that augments the system's effective ontology - onboarding a new
      source, accepting a self-extension during mediation, accepting a punctual
      extension - MUST be subject to authorisation appropriate to the
      operational role of the agent and MUST be auditable after the fact. Where
      a mediation involves presenting information at a level of detail more
      granular than would ordinarily be exchanged, policy controls MUST be
      enforced on what may be disclosed, to whom, and under what conditions, and
      anonymised or aggregated forms SHOULD be supported where finer detail
      cannot be released. The cognitive agents inherit the general risks of
      large-language-model-based systems, including prompt injection,
      hallucination, and miscalibrated confidence; implementations SHOULD apply
      the usual mitigations and require human review for decisions whose
      consequences are operationally significant.</t>
    </section>

    <section anchor="iana" numbered="true">
      <name>IANA Considerations</name>
      <t>This document has no IANA actions.</t>
    </section>

  </middle>

  <back>

    <references anchor="sec-normative-references">
      <name>Normative References</name>

      <reference anchor="RFC2119" target="https://www.rfc-editor.org/info/rfc2119">
        <front>
          <title>Key words for use in RFCs to Indicate Requirement Levels</title>
          <author initials="S." surname="Bradner" fullname="S. Bradner"/>
          <date year="1997" month="March"/>
        </front>
        <seriesInfo name="BCP" value="14"/>
        <seriesInfo name="RFC" value="2119"/>
        <seriesInfo name="DOI" value="10.17487/RFC2119"/>
      </reference>

      <reference anchor="RFC8174" target="https://www.rfc-editor.org/info/rfc8174">
        <front>
          <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
          <author initials="B." surname="Leiba" fullname="B. Leiba"/>
          <date year="2017" month="May"/>
        </front>
        <seriesInfo name="BCP" value="14"/>
        <seriesInfo name="RFC" value="8174"/>
        <seriesInfo name="DOI" value="10.17487/RFC8174"/>
      </reference>
    </references>

    <references anchor="sec-informative-references">
      <name>Informative References</name>

      <reference anchor="RFC8345" target="https://www.rfc-editor.org/info/rfc8345">
        <front>
          <title>A YANG Data Model for Network Topologies</title>
          <author initials="A." surname="Clemm" fullname="A. Clemm"/>
          <author initials="J." surname="Medved" fullname="J. Medved"/>
          <author initials="R." surname="Varga" fullname="R. Varga"/>
          <author initials="N." surname="Bahadur" fullname="N. Bahadur"/>
          <author initials="H." surname="Ananthakrishnan" fullname="H. Ananthakrishnan"/>
          <author initials="X." surname="Liu" fullname="X. Liu"/>
          <date year="2018" month="March"/>
        </front>
        <seriesInfo name="RFC" value="8345"/>
        <seriesInfo name="DOI" value="10.17487/RFC8345"/>
      </reference>

      <reference anchor="RFC8795" target="https://www.rfc-editor.org/info/rfc8795">
        <front>
          <title>YANG Data Model for Traffic Engineering (TE) Topologies</title>
          <author initials="X." surname="Liu" fullname="X. Liu"/>
          <author initials="I." surname="Bryskin" fullname="I. Bryskin"/>
          <author initials="V." surname="Beeram" fullname="V. Beeram"/>
          <author initials="T." surname="Saad" fullname="T. Saad"/>
          <author initials="H." surname="Shah" fullname="H. Shah"/>
          <author initials="O." surname="Gonzalez de Dios" fullname="O. Gonzalez de Dios"/>
          <date year="2020" month="August"/>
        </front>
        <seriesInfo name="RFC" value="8795"/>
        <seriesInfo name="DOI" value="10.17487/RFC8795"/>
      </reference>

      <reference anchor="I-D.ietf-ccamp-otn-topo-yang">
        <front>
          <title>A YANG Data Model for Optical Transport Network Topology</title>
          <author initials="I." surname="Busi" fullname="I. Busi"/>
          <author initials="S." surname="Belotti" fullname="S. Belotti"/>
          <author initials="V." surname="Lopez Alvarez" fullname="V. Lopez Alvarez"/>
          <author initials="A." surname="Sharma" fullname="A. Sharma"/>
          <author initials="Y." surname="Shi" fullname="Y. Shi"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-ietf-ccamp-otn-topo-yang"/>
        <refcontent>Work in Progress</refcontent>
      </reference>

      <reference anchor="I-D.ietf-ccamp-layer1-types">
        <front>
          <title>A YANG Data Model for Layer 1 Types</title>
          <author initials="H." surname="Zheng" fullname="H. Zheng"/>
          <author initials="Y." surname="Lee" fullname="Y. Lee"/>
          <author initials="A." surname="Guo" fullname="A. Guo"/>
          <author initials="V." surname="Lopez Alvarez" fullname="V. Lopez Alvarez"/>
          <author initials="D." surname="King" fullname="D. King"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-ietf-ccamp-layer1-types"/>
        <refcontent>Work in Progress</refcontent>
      </reference>

      <reference anchor="TAPI">
        <front>
          <title>Transport API (TAPI) - tapi-topology and tapi-connectivity YANG modules</title>
          <author>
            <organization>Open Networking Foundation (ONF)</organization>
          </author>
          <date year="2024"/>
        </front>
        <refcontent>ONF/OTCC specifications</refcontent>
      </reference>

      <reference anchor="ETSI-ZSM-019">
        <front>
          <title>Zero-touch network and Service Management (ZSM); ZSM Framework for NaaS</title>
          <author>
            <organization>ETSI ISG ZSM</organization>
          </author>
          <date year="2026" month="January"/>
        </front>
        <refcontent>ETSI GR ZSM 019 V1.1.1</refcontent>
      </reference>

      <reference anchor="PROMPT">
        <front>
          <title>The PROMPT Suite: Interactive Tools for Ontology Merging and Mapping</title>
          <author initials="N. F." surname="Noy" fullname="N. F. Noy"/>
          <author initials="M. A." surname="Musen" fullname="M. A. Musen"/>
          <date year="2003"/>
        </front>
        <refcontent>International Journal of Human-Computer Studies, Vol. 59, No. 6, pp. 983-1024</refcontent>
      </reference>

      <reference anchor="MAFRA">
        <front>
          <title>MAFRA - A MApping FRAmework for Distributed Ontologies</title>
          <author initials="A." surname="Maedche" fullname="A. Maedche"/>
          <author initials="B." surname="Motik" fullname="B. Motik"/>
          <author initials="N." surname="Silva" fullname="N. Silva"/>
          <author initials="R." surname="Volz" fullname="R. Volz"/>
          <date year="2002"/>
        </front>
        <refcontent>EKAW 2002, LNCS 2473, pp. 235-250</refcontent>
      </reference>

      <reference anchor="GLUE">
        <front>
          <title>Learning to Map between Ontologies on the Semantic Web</title>
          <author initials="A." surname="Doan" fullname="A. Doan"/>
          <author initials="J." surname="Madhavan" fullname="J. Madhavan"/>
          <author initials="P." surname="Domingos" fullname="P. Domingos"/>
          <author initials="A." surname="Halevy" fullname="A. Halevy"/>
          <date year="2003"/>
        </front>
        <refcontent>VLDB Journal</refcontent>
      </reference>

      <reference anchor="SMATCH">
        <front>
          <title>S-Match: An Algorithm and an Implementation of Semantic Matching</title>
          <author initials="F." surname="Giunchiglia" fullname="F. Giunchiglia"/>
          <author initials="P." surname="Shvaiko" fullname="P. Shvaiko"/>
          <author initials="M." surname="Yatskevich" fullname="M. Yatskevich"/>
          <date year="2004"/>
        </front>
        <refcontent>ESWS 2004</refcontent>
      </reference>

      <reference anchor="LOGMAP">
        <front>
          <title>LogMap: Logic-based and Scalable Ontology Matching</title>
          <author initials="E." surname="Jimenez-Ruiz" fullname="E. Jimenez-Ruiz"/>
          <author initials="B." surname="Cuenca Grau" fullname="B. Cuenca Grau"/>
          <date year="2011"/>
        </front>
        <refcontent>ISWC 2011</refcontent>
      </reference>

      <reference anchor="AML">
        <front>
          <title>The AgreementMakerLight Ontology Matching System</title>
          <author initials="D." surname="Faria" fullname="D. Faria"/>
          <author initials="C." surname="Pesquita" fullname="C. Pesquita"/>
          <author initials="E." surname="Santos" fullname="E. Santos"/>
          <author initials="M." surname="Palmonari" fullname="M. Palmonari"/>
          <author initials="I. F." surname="Cruz" fullname="I. F. Cruz"/>
          <author initials="F. M." surname="Couto" fullname="F. M. Couto"/>
          <date year="2013"/>
        </front>
        <refcontent>OTM Conferences, 2013</refcontent>
      </reference>

      <reference anchor="OAEI">
        <front>
          <title>Results of the OAEI 2025 Campaign</title>
          <author>
            <organization>Ontology Alignment Evaluation Initiative</organization>
          </author>
          <date year="2025"/>
        </front>
        <refcontent>CEUR-WS Vol. 4144</refcontent>
      </reference>

      <reference anchor="NORO2023">
        <front>
          <title>Conversational Ontology Alignment with ChatGPT</title>
          <author initials="S. S." surname="Norouzi" fullname="S. S. Norouzi"/>
          <author initials="M. S." surname="Mahdavinejad" fullname="M. S. Mahdavinejad"/>
          <author initials="P." surname="Hitzler" fullname="P. Hitzler"/>
          <date year="2023"/>
        </front>
        <refcontent>Ontology Matching Workshop, ISWC 2023, arXiv:2308.09217</refcontent>
      </reference>

      <reference anchor="HE2023">
        <front>
          <title>Exploring Large Language Models for Ontology Alignment</title>
          <author initials="Y." surname="He" fullname="Y. He"/>
          <author initials="J." surname="Chen" fullname="J. Chen"/>
          <author initials="H." surname="Dong" fullname="H. Dong"/>
          <author initials="I." surname="Horrocks" fullname="I. Horrocks"/>
          <date year="2023"/>
        </front>
        <refcontent>arXiv:2309.07172</refcontent>
      </reference>

      <reference anchor="LLMS4OM">
        <front>
          <title>LLMs4OM: Matching Ontologies with Large Language Models</title>
          <author initials="H. B." surname="Giglou" fullname="H. B. Giglou"/>
          <author initials="J." surname="D'Souza" fullname="J. D'Souza"/>
          <author initials="S." surname="Auer" fullname="S. Auer"/>
          <date year="2024"/>
        </front>
        <refcontent>arXiv:2404.10317</refcontent>
      </reference>

      <reference anchor="LLMORACLE">
        <front>
          <title>Large Language Models as Oracles for Ontology Alignment</title>
          <author>
            <organization>(authors not listed)</organization>
          </author>
          <date year="2025"/>
        </front>
        <refcontent>arXiv:2508.08500</refcontent>
      </reference>

      <reference anchor="GENOM">
        <front>
          <title>GenOM: Ontology Matching with Description Generation and Large Language Models</title>
          <author>
            <organization>GenOM Team</organization>
          </author>
          <date year="2026"/>
        </front>
        <refcontent>World Wide Web journal, arXiv:2508.10703</refcontent>
      </reference>

      <reference anchor="AGENTOM">
        <front>
          <title>Agent-OM: Leveraging LLM Agents for Ontology Matching</title>
          <author initials="Z." surname="Qiang" fullname="Z. Qiang"/>
          <author initials="W." surname="Wang" fullname="W. Wang"/>
          <author initials="K." surname="Taylor" fullname="K. Taylor"/>
          <date year="2024"/>
        </front>
        <refcontent>Proceedings of the VLDB Endowment, Vol. 18, No. 3, pp. 516-529</refcontent>
      </reference>

      <reference anchor="BAILIN2001">
        <front>
          <title>Ontology Negotiation between Scientific Archives</title>
          <author initials="S. C." surname="Bailin" fullname="S. C. Bailin"/>
          <author initials="W." surname="Truszkowski" fullname="W. Truszkowski"/>
          <date year="2001"/>
        </front>
        <refcontent>NASA Technical Reports Server</refcontent>
      </reference>

      <reference anchor="BAILIN2002">
        <front>
          <title>Ontology Negotiation between Intelligent Information Agents</title>
          <author initials="S. C." surname="Bailin" fullname="S. C. Bailin"/>
          <author initials="W." surname="Truszkowski" fullname="W. Truszkowski"/>
          <date year="2002"/>
        </front>
        <refcontent>The Knowledge Engineering Review, Vol. 17, No. 1, pp. 7-19</refcontent>
      </reference>

      <reference anchor="VDIGGELEN">
        <front>
          <title>Ontology Negotiation: Goals, Requirements and Implementation</title>
          <author initials="J." surname="van Diggelen" fullname="J. van Diggelen"/>
          <author initials="R.-J." surname="Beun" fullname="R.-J. Beun"/>
          <author initials="F." surname="Dignum" fullname="F. Dignum"/>
          <author initials="R. M." surname="van Eijk" fullname="R. M. van Eijk"/>
          <author initials="J.-J." surname="Meyer" fullname="J.-J. Meyer"/>
          <date year="2007"/>
        </front>
        <refcontent>International Journal of Agent-Oriented Software Engineering, Vol. 1, No. 1, pp. 63-90</refcontent>
      </reference>

      <reference anchor="PAHL2014">
        <front>
          <title>Crowdsourced Context-Modeling as Key to Future Smart Spaces</title>
          <author initials="M.-O." surname="Pahl" fullname="M.-O. Pahl"/>
          <author initials="G." surname="Carle" fullname="G. Carle"/>
          <date year="2014"/>
        </front>
        <refcontent>IEEE/IFIP NOMS 2014</refcontent>
      </reference>

      <reference anchor="VSL2019">
        <front>
          <title>VSL: A Data-Centric Internet of Things Overlay</title>
          <author initials="M.-O." surname="Pahl" fullname="M.-O. Pahl"/>
          <author initials="S." surname="Liebald" fullname="S. Liebald"/>
          <author initials="C." surname="Lübben" fullname="C. Lübben"/>
          <date year="2019"/>
        </front>
        <refcontent>NetSys 2019</refcontent>
      </reference>

      <reference anchor="GATEWAYX">
        <front>
          <title>Gateway-X: LLM-based Autonomous Adaptive Semantic and Syntactic Protocol Translation</title>
          <author initials="C." surname="Lübben" fullname="C. Lübben"/>
          <author initials="M.-O." surname="Pahl" fullname="M.-O. Pahl"/>
          <date year="2026"/>
        </front>
        <refcontent>AIMLOps Workshop, IEEE/IFIP NOMS 2026</refcontent>
      </reference>

      <reference anchor="AICEP">
        <front>
          <title>AICEP: A Standardless, AI-native Control Plane for Network Management</title>
          <author initials="H." surname="Kukkalli" fullname="H. Kukkalli"/>
          <date year="2026"/>
        </front>
        <refcontent>IEEE/IFIP NOMS 2026, Technische Universität Chemnitz</refcontent>
      </reference>
    </references>

    <section anchor="acknowledgments" numbered="false">
      <name>Acknowledgments</name>
      <t>The authors thank colleagues for discussions that shaped the ideas in
      this document, and members of the NMRG and NMOP for ongoing exchanges on
      the role of agentic AI in network management.</t>
    </section>

  </back>
</rfc>
