<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Beyond Prompt-to-RDF: A Vision for Scalable and Explainable Graph Transformations via LLM-assisted Schema Mappings</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yannis Marketakis</string-name>
          <email>marketak@ics.forth.gr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yannis Tzitzikas</string-name>
          <email>tzitzik@ics.forth.gr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Computer Science Department, University of Crete</institution>
          ,
          <addr-line>Heraklion</addr-line>
          ,
          <country country="GR">Greece</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institute of Computer Science, Foundation for Research and Technology - Hellas</institution>
          ,
          <addr-line>Heraklion</addr-line>
          ,
          <country country="GR">Greece</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>The increasing adoption of Large Language Models (LLMs) has led to a growing number of prompt-to-RDF approaches that rely on LLMs to directly transform heterogeneous data collections into RDF graph representations. While efective for rapid prototyping, such approaches raise concerns regarding transparency, reproducibility, and maintainability, as modeling decisions remain implicit and dificult to validate or reuse. This vision paper argues for repositioning LLMs in graph transformation workflows, from black-box data transformers to assistive generators of schema mappings. In the proposed approach, LLMs are used to produce schema mappings, a task that is traditionally manual and labor-intensive, while data transformation is delegated to established data transformation frameworks. By doing so, the schema mapping process can be significantly accelerated, addressing key bottlenecks in large-scale semantic integration pipelines. The paper grounds this vision in ongoing work that explores the use of diferent LLMs and prompting strategies to generate schema mappings using X3ML mapping framework. While a full experimental evaluation is beyond the scope of this paper, this work illustrates the feasibility of the approach. Overall, the paper outlines a research agenda towards more explainable, trustworthy and semantically grounded LLM-assisted transformation pipelines.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Large Language Models</kwd>
        <kwd>Schema Mapping Generation</kwd>
        <kwd>RDF Graph Transformation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>The transformation of heterogeneous data into RDF graph representations plays a central role in
semantic data integration, knowledge graph construction and interoperability across information
systems. By lifting data from relational databases, tabular files, APIs, and semi-structured formats into
RDF graphs aligned with shared ontologies, organizations can enable semantic querying, reasoning,
data re-use, and cross-domain integration. As a result, the transformation of data to RDF-based graphs
has become a foundational component of data infrastructures across various domains such as cultural
heritage, life sciences, e-government and others.</p>
      <p>
        At the same time, the scale and diversity of data landscapes across diferent disciplines, pose significant
challenges for RDF graph construction. Large volumes of heterogeneous data are continuously produced,
updated, and exchanged. In this context, through the recent advances in Large Language Models (LLMs),
emerged a new alternative for constructing RDF knowledge graphs. These approaches have explored
the use of LLMs as tools to directly transform raw data into RDF graphs. While this approach is quick
and attractive for small-scale scenarios and rapid prototyping, it has serious limitations over massive
and continuously evolving datasets. Furthermore, it is computationally expensive and dificult to sustain
in production systems. In addition, repeatedly invoking LLMs for data transformations raises concerns
regarding cost, latency and operational scalability. Similar concerns have been raised in recent work
on deep learning, which highlights the need for scalable graph-based abstractions over relational data,
rather than relying on costly instance-level processing pipelines [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>In contrast, schema mappings provide a well-established mechanism for specifying how source data
structures correspond to target schemata (i.e. ontologies). Such mappings make modeling decisions
explicit, enable the reuse across datasets, and support validation, adaptation, debugging, and maintenance
of transformation pipelines. After the definition of schema mappings, dedicated data transformation
software components, use them to transform data and construct RDF knowledge graphs. However, the
definition of schema mappings remains a manual and expertise-intensive process, often constituting
a major bottleneck in semantic integration workflows. More specifically, the definition of schema
mappings requires expertise and knowledge of: (a) the domain and the schema of the source data, (b)
the target ontology, and (c) the schema mapping technology. Given the volume and heterogeneity of
today’s data, the manual generation of schema mappings does not scale.</p>
      <p>This paper argues that automating the construction of schema mappings is a more efective and
sustainable strategy than applying LLMs directly to data transformation. By leveraging LLMs to assist
in generating schema mappings, rather than transforming data themselves, semantic data integration
pipelines can combine scalability and eficiency with transparency and semantic validation. This vision
positions LLMs as accelerators of human modeling efort, enabling the definition of explicit, reusable
schema mappings that can be exploited by existing transformation frameworks and tools over large
volumes of data.</p>
      <p>The contributions of our work are: (a) a conceptual reframing of the role of LLMs for graph
transformations, positioning themselves as assistants for schema mapping generation, rather than data
transformation engines; (b) an analysis of the limitations of prompt-to-RDF approaches; and (c) a
grounded vision for scalable and reusable semantic data integration based on X3ML schema mapping
framework.</p>
      <p>The paper is organized as follows: Section 1 introduces the objectives of the paper and outlines
its main contributions. Section 2 provides background information and details about related works.
Section 3 elaborates on the limitations of prompt-to-RDF approaches. Section 4 presents our vision of
repositioning LLMs as schema mapping accelerators. Section 5 grounds this vision by discussing our
experience to date with an existing schema mapping framework and LLMs. Finally, Section 6 concludes
and identifies directions for further research.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Background &amp; Related work</title>
      <p>
        The construction of RDF knowledge graphs through data transformation from heterogeneous data
sources has been extensively studied in the literature (e.g. the survey in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]). A dominant approach
relies on the use of schema mapping languages, which declaratively specify how data structured
according to a source schema are transformed into resources conforming to a target schema or ontology.
Such languages define transformation rules in a structured, unambiguous manner, making modelling
decisions explicit and machine-interpretable. Representative examples include X3ML language [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], RML
[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], and R2RML [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. These languages are supported by tools that execute the mappings to systematically
produce RDF knowledge graphs.
      </p>
      <p>
        More recently, several approaches have explored the use of LLMs to directly transform data into RDF.
LLM2KB [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] proposes a system for constructing knowledge bases by relying on LLMs to generate RDF
content, while other works, such as [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], adopt iterative refinement strategies to improve the generated
outputs. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] evaluates the ability of diferent LLMs in generating knowledge graphs serialized in Turtle
syntax. SQLMorpher [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] focuses on automating data transformation from relational databases in the
energy domain, whereas [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] studies the efectiveness of diferent GPT models across common data
transformation tasks. Finally, [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] investigates the suitability of LLMs for populating knowledge graphs
from structured data sources.
      </p>
      <p>While both schema mapping-based approaches and LLM-based approaches aim to transform
heterogeneous data into RDF knowledge graphs they difer in how transformation logic is expressed and
applied. The implications of these diferences are examined in the following section.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Limitations of Prompt-to-RDF Approaches</title>
      <p>A key limitation of direct LLM-based data transformation is the absence of an explicit intermediate
representation, that describe class assignments, property selections and others. In prompt-to-RDF
workflows, such modeling decisions are embedded implicitly in the generated RDF triples. This lack
of an explicit schema mapping layer makes it dificult to verify, review, or adjust transformation logic
before its execution. As a result, validation typically occurs only after RDF graphs are constructed, at
which point identifying and correcting potential errors becomes costly and impractical.</p>
      <p>Another issue, closely related to the previous one, is the limited support for debugging and
maintenance. When errors occur in RDF graphs produced by LLMs, tracing their origin is cumbersome,
as there is no inspectable step that documents how source elements were transformed. In contrast
to traditional schema mapping approaches, prompt-to-RDF transformations operate as black boxes,
complicating error diagnosis and refinement of the transformation logic.</p>
      <p>Another concern is variability in transformation results. LLM-based data transformations may yield
diferent RDF graphs across runs, prompts, or model versions, even when applied to the same source
data. Such variability undermines reproducibility, raises concerns for the accuracy of the generated
graphs, and poses significant challenges for maintaining consistent RDF graph representations especially
when applied over continuously evolving data sources.</p>
      <p>Scalability and eficiency further limit the applicability of prompt-to-RDF approaches. Applying
LLMs directly to large data collections requires repeated model invocations over large volumes of data,
leading to high computational cost and latency. This is a problem that does not occur when source data
are used for generating schema mappings, since in this case only a small subset or sample of the data is
needed. Of course, even in this case, the transformation of large volumes of data has a computational
cost, which is however lower and can scale using dedicated transformation frameworks, compared to
LLMs.</p>
      <p>Overall, these limitations highlight that directly relying on LLMs for data transformations mixes
transformation logic with transformation execution. This coupling hinders verification, debugging,
reproducibility, and scalability, motivating the need for alternative approaches that preserve explicit
transformation logic while still get all the potential from LLM capabilities.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Vision: LLM-assisted Schema Mapping Generation</title>
      <p>The aforementioned limitations indicate that the challenges of LLM-based data transformations stem
not from the actual use of LLM themselves, but from their direct application to data-level
transformation. In particular, the absence of an explicit and inspectable transformation layer hinders validation,
debugging and reuse of the transformation logic. This observation suggests that the strengths of LLMs
(i.e. their ability to interpret the semantics of heterogeneous data) could be more efectively leveraged at
the level of schema mapping generation rather than the data transformation execution. For this reason,
we outline a vision for repositioning LLMs as assistants for generating explicit schema mappings,
enabling scalable and explainable graph transformation pipelines while preserving the benefits of
existing transformation frameworks.</p>
      <p>Figure 1 illustrates the proposed vision; heterogeneous data sources are first collected and structurally
normalized so that they can be consistently interpreted by the transformation engine used at execution
time. Representative samples are selected to capture the structural characteristics and semantics of
the source schema, as the objective is to derive mapping rules and correspondences, not to transform
the entire dataset during prompting. A small subset or sample of those data, together with the target
ontologies are then given as input to an LLM-assisted schema mapping generator component through a
prompt construction process. Rather than operating on a full data collection, LLMs are guided using
samples to generate explicit schema mappings that capture how source data elements correspond to
classes, properties and relationships in the target ontologies. Crucially, no data-level transformation is
performed by the LLM; the outcome of this process is the inspectable schema mappings, where expert
validation results can be fed back to the generator to guide subsequent mapping generation rounds.</p>
      <p>
        The schema mapping repository plays a central role in the proposed architecture by supporting and
guiding the LLM-assisted schema mapping generation process. More specifically, the repository acts as
a source of contextual knowledge that can be exploited to improve the accuracy and consistency of the
generated mappings. Existing schema mappings can be retrieved based on their relevance with new
data sources; for example, by comparing the structure or the contents of the source data, with the input
data used in existing schema mappings (e.g. using text embeddings [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]). Then the selected ones can be
provided as additional contextual input to the prompt construction process, enabling the LLM to reuse
valid and assessed schema mappings. This approach facilitates the improvement, while preserving the
explicit and inspectable nature of the generated schema mappings.
      </p>
      <p>The generated schema mappings can be therefore reviewed, validated and refined by mapping experts
prior to their execution, enabling early detection of modeling errors. Importantly, expert feedback
resulting from this validation process can be fed back to the LLM-assisted schema mapping generation
component, allowing the revision of the mappings based on curated human advice. Expert feedback
is incorporated by adding corrected mappings fragments to subsequent prompts enabling iterative
refinement of the generated schema mappings.</p>
      <p>
        Upon the definition of the schema mappings and their revision/validation by mapping experts, the
generated schema mappings can be used for the actual data transformation part. This is carried out
without relying on the LLM, by delegating it to well-known data transformation engines (e.g. X3ML
Engine [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] or RMLMapper [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]), that consume the validated schema mappings and apply them over
large volumes of data to produce RDF graphs. Furthermore, this process can be repeated as needed,
for example when new or updated data become available, without requiring invoking the LLM and
regenerating the schema mappings.
      </p>
      <p>This explicit feedback loop, together with the separation of mapping definition from transformation
execution enables a scalable and explainable approach to graph transformation in which human expertise
and LLM capabilities are efectively combined. This solution significantly accelerates the traditionally
manual and time-consuming schema mapping definition process. At the same time, delegating the
actual data transformations to dedicated transformation engines ensures eficiency, reproducibility,
and robustness when operating over large and evolving data collections. Table 1 shows a side-by-side
comparison with respect to diferent aspects.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Grounding the Vision with X3ML Mapping Framework</title>
      <p>
        To ground the proposed vision in practice, this section summarizes ongoing work that explores the use
of LLMs for generating schema mappings based on X3ML framework [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. X3ML provides a declarative
mapping language and a transformation engine, and has been widely adopted in domains such as
cultural heritage and biodiversity. Despite this support, defining schema mappings remains a manual
and time-consuming task requiring expertise in both source schemata and target ontologies.
      </p>
      <p>
        Figure 2 illustrates a minimal example of the proposed approach. The upper part consists of an
XML source record describing a person with an identifier and a name. Based on this and the target
ontology (e.g., CIDOC CRM [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] in this case), the LLM is prompted to generate an X3ML mapping
that associates record elements with the class E21_Person, and then map the id element to an instance
of E42_Identifier via the property P1_is_identified. The generated mapping constituted an explicit
transformation specification that can be validated by mapping experts before being executed by the
X3ML Engine for transforming all the conforming records into RDF triples. This example highlights the
separation between mapping generation and data transformation execution, which enables transparency,
validation and reuse at large scale.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] we investigate whether LLMs can efectively assist in accelerating the definition of X3ML
schema mapping by experimenting with multiple LLMs and prompting strategies. Five diferent
LLMs, GPT4.1, DeepSeek-V3, Mistral, Grok-3, and Llamma-4, were considered under three prompting
techniques that reflect diferent levels of guidance. The zero-shot technique provides the LLM only
with descriptions of the source data and the target ontology, assessing its ability to generate mappings
without additional context. The syntax-aware technique augments the prompt with guidance on the
structure of the X3ML mapping language, aiming to improve syntactic correctness and alignment
with the expected mapping structure and format. Finally, in-context technique supplies the prompt
with existing X3ML mappings that were defined for semantically and structurally similar source data,
alongside with the current source data, enabling the LLM to reuse established modelling patterns.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], schema mapping generation was assessed by comparing generated X3ML mappings against
manually curated reference mappings. A mapping was considered correct if its generated mapping
resources (e.g., source schema elements and target ontology resources) matched the reference mappings,
and conformed to valid X3ML syntax. Accuracy therefore reflects the proportion of correctly generated
mapping components in the reference mappings. This high-level metric is intended to provide indicative
trends rather than a fine-grained performance comparison. To support transparency and reproducibility,
the benchmark, the reference mappings, the prompts, and evaluation scripts are publicly available in an
online repository1.
      </p>
      <p>Figure 3 provides an aggregated overview of the impact of the prompting techniques on the accuracy
of the generated schema mappings. The figure is intended to illustrate general trends, rather than to
support a detailed comparative evaluation that goes beyond the scope of this vision paper. As shown,
zero-shot prompting yields the lowest accuracy, as it frequently generates schema mappings with
invalid or incomplete structure with respect to X3ML schema. Syntax-aware prompting significantly
improves the validity and usefulness of the generated mappings, by constraining the LLM output to
the expected mapping format. In-context prompting technique further improves accuracy by guiding
the LLM with representative examples, leading to schema mappings that align to existing modelling
practices and consists of semantically correct components.</p>
      <p>Our observations directly support the design choices outlined in Section 4. In particular the
efectiveness of in-context prompting reinforces the central role of reusing existing schema mappings in guiding
LLM-assisted mapping generation. Direct quantitative comparison with existing techniques is currently
not possible, as there are no established baselines for this. Consequently, the reported accuracy values
should be interpreted as indicative evidence of feasibility rather than competitive performance results.
The observed average accuracy of 0.53 for the in-context strategy should be interpreted in relation to
the complexity of schema mapping definition, which typically requires expert knowledge of the source
domain and schemata, target ontologies and mapping languages. Achieving correct generation for more
than half of mapping components without manual authoring constitutes a strong indication that the
traditionally manual and time-consuming schema mapping process can be substantially accelerated,
and in certain cases partially automated. We should however mention that this level of accuracy is
not intended to replace expert involvement, but to provide high-quality initial mappings and reduce
manual efort.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion and Research Agenda</title>
      <p>This paper presented a vision for repositioning LLMs in graph transformation workflows, motivated
by the scale and diversity of data landscapes. Given the massive volumes of heterogeneous data that
must be integrated today, relying on LLMs to directly transform data into RDF knowledge graphs is
impractical and highly resource-consuming. In this context, accelerating the traditionally manual and
expertise-intensive task of schema mapping definition emerges as a sustainable strategy for enabling
large-scale semantic data integration. By using LLMs as assistive generators of schema mappings
rather than as black-box data transformation engines, the proposed approach decouples transformation
logic from execution and enables scalable and transparent and semantically enhanced transformation
pipelines. The grounding of this vision through ongoing work with the X3ML framework, demonstrates
the practical feasibility of the proposed approach. Observations reveal strong indications that the
time-consuming schema mapping process can be substantially accelerated. Overall, this vision opens
opportunities for hybrid human-LLM workflows, in which language models support human experts,
while established transformation frameworks ensure scalability in production settings. Looking to
the future, several research directions stem from this work, such as methods to improve LLM-assisted
mapping generation, the investigation of decomposing complex source data into smaller units that
can be used for generating more fine-grained schema mappings, and methods for retrieving relevant
existing mappings to support in-context generation.
1https://github.com/ymark/x3ml_comparator</p>
    </sec>
    <sec id="sec-7">
      <title>Declaration on Generative AI</title>
      <p>The authors did not use generative AI systems for generating scientific content, analysis, results, figures
or conclusions presented in the paper; such tools were used exclusively for language refinement and
proofreading.</p>
      <p>Figure 2: Illustrative example of an XML source record, and the corresponding X3ML schema mapping.
Figure 3: Aggregated accuracy of diferent prompting strategies.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Fey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. E.</given-names>
            <surname>Lenssen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ranjan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Robinson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ying</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>You</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Leskovec</surname>
          </string-name>
          , Position:
          <article-title>Relational deep learning-graph representation learning on relational databases</article-title>
          ,
          <source>in: Forty-first International Conference on Machine Learning</source>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>D. V.</given-names>
            <surname>Assche</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Delva</surname>
          </string-name>
          , G. Haesendonck,
          <string-name>
            <given-names>P.</given-names>
            <surname>Heyvaert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. D.</given-names>
            <surname>Meester</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Dimou</surname>
          </string-name>
          ,
          <article-title>Declarative rdf graph generation from heterogeneous (semi-) structured data: A systematic literature review</article-title>
          ,
          <source>Journal of Web Semantics</source>
          <volume>75</volume>
          (
          <year>2023</year>
          ). doi:
          <volume>10</volume>
          .1016/j.websem.
          <year>2022</year>
          .
          <volume>100753</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Marketakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Minadakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kondylakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Konsolaki</surname>
          </string-name>
          , G. Samaritakis,
          <string-name>
            <given-names>M.</given-names>
            <surname>Theodoridou</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Doerr, X3ml mapping framework for information integration in cultural heritage and beyond</article-title>
          ,
          <source>International Journal on Digital Libraries</source>
          <volume>18</volume>
          (
          <year>2017</year>
          )
          <fpage>301</fpage>
          -
          <lpage>319</lpage>
          . doi:
          <volume>10</volume>
          .1007/s00799-016-0179-1.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Dimou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. V.</given-names>
            <surname>Sande</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Colpaert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Verborgh</surname>
          </string-name>
          , E. Mannens, R. V. de Walle,
          <article-title>Rml: A generic language for integrated rdf mappings of heterogeneous data, workshop on linked data on the web (ldow) 1184 (</article-title>
          <year>2014</year>
          ),
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>World</given-names>
            <surname>Wide Web Consortium</surname>
          </string-name>
          , R2rml: Rdb to rdf
          <source>mapping language</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Nayak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. P.</given-names>
            <surname>Timmapathini</surname>
          </string-name>
          , Llm2kb:
          <article-title>Constructing knowledge bases using instruction tuned context aware large language models, international semantic web conference (iswc) workshop on knowledge base construction from pre-trained language models (</article-title>
          <year>2023</year>
          ),
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S.</given-names>
            <surname>Carta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Giuliani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Piano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Podda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Pompianu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. G.</given-names>
            <surname>Tiddia</surname>
          </string-name>
          ,
          <article-title>Iterative zero-shot llm prompting for knowledge graph construction</article-title>
          ,
          <year>2023</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2307.01128. arXiv:
          <volume>2307</volume>
          .01128, arXiv preprint.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Frey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. P.</given-names>
            <surname>Meyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Arndt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Brei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Bulert</surname>
          </string-name>
          ,
          <article-title>Benchmarking the abilities of large language models for rdf knowledge graph creation and comprehension: How well do llms speak turtle</article-title>
          ?,
          <year>2023</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2309.17122. arXiv:
          <volume>2309</volume>
          .17122, arXiv preprint.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Sharma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Guan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Wu</surname>
          </string-name>
          , et al.,
          <article-title>Automatic data transformation using large language model-an experimental study on building energy data</article-title>
          ,
          <source>2023 ieee international conference on big data (bigdata)</source>
          (
          <year>2023</year>
          )
          <fpage>1824</fpage>
          -
          <lpage>1834</lpage>
          ,
          <year>2023</year>
          . doi:
          <volume>10</volume>
          .1109/BigData59044.
          <year>2023</year>
          .
          <volume>10386931</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ghazzai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Grigori</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Benatallah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Rebai</surname>
          </string-name>
          ,
          <article-title>Harnessing gpt for data transformation tasks</article-title>
          ,
          <source>2024 ieee international conference on web services (icws)</source>
          (
          <year>2024</year>
          )
          <fpage>1329</fpage>
          -
          <lpage>1334</lpage>
          ,
          <year>2024</year>
          . doi:
          <volume>10</volume>
          .1109/ ICWS62655.
          <year>2024</year>
          .
          <volume>00160</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S. S.</given-names>
            <surname>Norouzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Barua</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Christou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Gautam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Eells</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hitzler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Shimizu</surname>
          </string-name>
          , Ontology population using llms,
          <year>2024</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2411.01612. arXiv:
          <volume>2411</volume>
          .01612, arXiv preprint.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>T.</given-names>
            <surname>Kenter</surname>
          </string-name>
          , M. de Rijke,
          <article-title>Short text similarity with word embeddings</article-title>
          ,
          <source>in: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>1411</fpage>
          -
          <lpage>1420</lpage>
          . doi:
          <volume>10</volume>
          .1145/2806416.2806475.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>X3ml</given-names>
            <surname>Engine</surname>
          </string-name>
          ,
          <year>2025</year>
          . URL: https://github.com/isl/x3ml.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>A.</given-names>
            <surname>Dimou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. D.</given-names>
            <surname>Nies</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Verborgh</surname>
          </string-name>
          , E. Mannens,
          <string-name>
            <given-names>P.</given-names>
            <surname>Mechant</surname>
          </string-name>
          , R. V. de Walle,
          <article-title>Automated metadata generation for linked data generation and publishing workflows</article-title>
          ,
          <source>in: Proceedings of the 9th Workshop on Linked Data on the Web</source>
          , Montreal, Canada,
          <year>2016</year>
          ,
          <year>2016</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>M.</given-names>
            <surname>Doerr</surname>
          </string-name>
          ,
          <article-title>The CIDOC CRM, an ontological approach to schema heterogeneity</article-title>
          ,
          <source>Schloss DagstuhlLeibniz-Zentrum für Informatik</source>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Marketakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lintanf-Castel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tzitzikas</surname>
          </string-name>
          ,
          <article-title>Using llms to automate schema mappings for rdf knowledge graphs construction</article-title>
          ,
          <source>in: Poster in the 41st ACM/SIGAPP Symposium on Applied Computing</source>
          , Thessalloniki, Greece,
          <year>March 2026</year>
          (to appear),
          <year>2026</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>