<!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>LLM-Based Composition of Smart Data Services in Shop Floors</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Adriano Izzi</string-name>
          <email>izzi.2048338@studenti.uniroma1.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jerin George Mathew</string-name>
          <email>jeringeorge.mathew@uniroma1.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Flavia Monti</string-name>
          <email>monti@diag.uniroma1.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Donatella Firmani</string-name>
          <email>donatella.firmani@uniroma1.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Francesco Leotta</string-name>
          <email>leotta@diag.uniroma1.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Federica Mandreoli</string-name>
          <email>federica.mandreoli@unimore.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Massimo Mecella</string-name>
          <email>mecella@diag.uniroma1.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Sapienza Università di Roma</institution>
          ,
          <addr-line>Rome</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Università di Modena e Reggio Emilia</institution>
          ,
          <addr-line>Modena</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>The use of Large Language Models (LLMs) has expanded across various domains, simplifying tasks such as coding, querying relational databases, and service composition. In this work, we explore their role in industrial data access, enabling shop-floor operators to issue natural language queries and obtain structured tables integrating data from multiple sources, including machines and information systems. We present a system that takes user queries as input and automatically generates a data processing pipeline that leverages available data services to construct a table satisfying the user's information needs. Our approach is evaluated on a real-world case study, demonstrating that incorporating data service descriptions and prior pipelines leads to accurate results compared to directly applying a state-of-the-art code generation tool.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Smart data services</kwd>
        <kwd>Service composition</kwd>
        <kwd>Data generation</kwd>
        <kwd>Large Language Models</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        B
struggle to retrieve timely information due to evolving data needs, and continuously developing
new pipelines to address these needs incurs substantial costs. This issue is particularly critical
for non-IT-focused manufacturing companies, which typically outsource data management
tasks. While data governance platforms ofer partial relief, their reliance on extensive backend
data lakes makes them impractical for many organizations, particularly Small and Medium
Enterprises (SMEs), which often lack the financial, technical, and human resources required
to maintain such systems [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Conversely, chat-enabled digital assistants are emerging as an
intuitive interface for human-machine interaction, drawing increasing interest from industrial
applications [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. By allowing shop floor operators to interact with data services through natural
language queries, these assistants can provide fast, user-friendly, and hands-free access to
critical information. Large Language Models (LLMs) have recently demonstrated remarkable
capabilities in handling complex queries, particularly when enhanced with external tools such
as search engines and databases [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>Example case study. Consider a cardboard manufacturing plant, illustrated in Figure 1. The
production process relies on two primary machines: ○ A a die-cutting machine, which cuts
cardboard using interchangeable die cutters, and ○ B a stacker, which groups cut-out cardboard
into bundles. The die cutter is equipped with a chip that tracks its speed in rotations per second,
while a high-resolution camera monitors the production line, detecting defective cardboards. A
second camera, placed after the stacker, records the completion of each bundle. Several data
services are involved in this scenario, such as (i) DS1, which retrieves the speed of the active
die cutter, (ii) DS2 which identifies the camera monitoring a specific die cutter, (iii) DS3 which
captures an image frame from a specific camera, (iv) DS4, which detects defects in a given
cardboard image, and (v) DS5, which signals when a new bundle is complete. Now, suppose an
operator submits the following natural language query:
Q: “For the current session of the die cutter with ID 7, generate a table containing (i) the
number of defect-free cardboards and (ii) those with errors.”</p>
      <p>In this work we envision a system capable of leveraging LLMs to dynamically construct a
pipeline that fulfill a natural language query, composing the required data services and treating
sensors, cameras, and other tools as external knowledge sources. Specifically, to answer Q, first,
DS2 is invoked to retrieve the ID of the camera monitoring die cutter 7 (e.g., camera 74240).
Then, DS3 captures a frame from camera 74240, recording a sample of the produced cardboard.
Finally, DS3 analyzes the captured image to determine if defects are present.
Contribution. In this work we present a methodology, together with a prototype
implementation, for synthesizing information extraction pipelines in the form of Python scripts,
starting from natural language queries. The system utilizes a documented codebase that includes
available data services and previously defined pipelines. These pipelines may be manually
created or previously generated using our solution.</p>
      <p>
        Outline. The rest of this paper is structured as follows. Section 2 provides background
and discusses related work. Section 3 presents the core components of the proposed solution.
Section 4 describes technical implementation details. Section 5 reports experimental results.
Finally, Section 6 outlines future challenges and presents concluding remarks. This paper builds
on our previous work [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], summarizing its key insights and providing an overview of the system
and its implementation.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Works</title>
      <p>
        LLM in data management. LLMs are transforming data management with applications in
querying relational databases [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ], reasoning over structured data [
        <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
        ], and automating data
cleaning [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. These works typically operate over existing relational data. In contrast, our system
constructs relational outputs from scratch by composing data services. The idea of generating
tables with LLMs has also been explored in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], where models enhance database results with
external knowledge from their pretraining. In contrast, our approach does not treat the LLM as
an information source but as a mechanism to identify and compose data services.
LLM for service composition. LLM Agents [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], which invoke external tools, naturally align
with the concept of service composition [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], where complex tasks are fulfilled by combining
component services. This capability has been explored in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], where an agent orchestrates
process-execution tools to produce business logic code. More broadly, LLM-based service
composition has shown promise [
        <xref ref-type="bibr" rid="ref14 ref15">14, 15</xref>
        ], though expert supervision remains necessary due to
limitations in accuracy and reliability.
      </p>
      <p>
        LLM for code generation. Due to the structural similarity between code and natural
language, LLMs are widely used in software engineering for tasks such as code understanding
and synthesis [
        <xref ref-type="bibr" rid="ref16 ref17 ref18">16, 17, 18</xref>
        ]. These models can translate descriptions into executable code, often
capturing non-trivial logic [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. Prominent examples include Codex [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] and AlphaCode [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
More recent developments, such as LLM Agents and self-reflection techniques [ 21], have further
improved performance in complex code generation tasks.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. System Architecture</title>
      <p>Figure 2 illustrates the architecture of the proposed approach. The process begins when a
human operator submits a natural language query ○ 1 to retrieve information from an ongoing
manufacturing process. Queries can include parameters such as time ranges or specific defect
types but do not assume prior knowledge of available data services. Instead, they specify only
the required information, without technical details on how to compute it. At the core of the
architecture is the LLM Agent, which constructs a query-specific prompt for a pre-trained LLM.
The prompt is generated based on information retrieved by the dynamic context retrieval module.
6 query, pipeline
query
1</p>
      <p>Dynamic
context retrieval 2b
5</p>
      <p>Pipeline
Repository
Data service
Repository
This component identifies ○2a relevant example pipelines from the pipeline repository and ○2b
suitable data services from the data service repository to help answer the query. Manufacturing
assets expose data services that range from actuation services (e.g., activating a camera) to
data-generating services (e.g., retrieving the current speed of a die-cutting machine). These
services operate through various communication protocols, but for simplicity, they are assumed
to be callable via function calls. Each service may require parameters and return structured or
unstructured outputs. The data service repository stores documentation describing each service
functionality and usage. The pipeline repository contains predefined pipelines, either manually
created or derived from previous executions of our solution. Each pipeline is linked to the query
it was designed to fulfill and is represented as a software script (Python) that (i) produces a
structured table as output and (ii) utilizes data services. Pipelines can be expressed in diferent
formalisms, such as programming languages or workflow scripting languages [ 22]. Once the
relevant pipelines and data service documentation are retrieved, they are provided ○ 3 to the
LLM Agent along with the query. This information is incorporated into a structured prompt
template, guiding the LLM in generating an appropriate pipeline. The generated pipeline is then
executed ○ 4 in an execution environment, such as a Python interpreter. The execution produces
a structured table ○ 5 that answers the query. If the human operator thinks the produced pipeline
can be helpful as a future reference for future queries, the pipeline together with the originating
query can be stored ○ i6n the pipeline repository for further reuse.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Implementation Details</title>
      <p>In this section, we outline the implementation details of the proposed solution. A prototype1
has been developed in Python using the Langchain framework2. The LLM Agent is based on
OpenAI’s GPT-4 (gpt-4-turbo)3.
1For repeatability, both the source code and experimental results are publicly available at: https://github.com/
jermathew/COSMADS
2See https://www.langchain.com/
3GPT-4 can be replaced with any other LLM, though adjustments to the prompt may be needed to maintain accuracy.
Dynamic Context Retrieval. The LLM Agent’s prompt is built using two key elements: (i)
relevant past queries and their associated pipelines as few-shot examples, and (ii) the set of
data services required to answer the input query. As outlined in Section 3, this information
is retrieved from the pipeline repository and data service repository, respectively. The pipeline
repository is a vector store that maintains embeddings of solved queries, computed using
OpenAI’s text-embedding-ada-002, along with metadata pointing to the corresponding
Python pipelines. For eficient storage and search, we use DocArray’s DocIndex 4, which
integrates with Langchain. Given a user query, its embedding is computed and the top-5 most
similar queries are retrieved using cosine similarity. The data service repository lists services
that enable access to historical and real-time data. These are typically implemented as Python
classes, each including: (i) a function that wraps the actual service logic, and (ii) a documentation
ifeld that describes its functionality, usage, example invocation, and input/output parameters.
The LLM Agent relies on this documentation to compose pipelines using the appropriate services.
While only the top- example pipelines are included in the prompt, all data services are made
available. This design assumes the set of services remains relatively stable over time, whereas
the number of pipelines is expected to grow. Including all services avoids generation errors due
to missing service descriptions.</p>
      <p>LLM Agent. Our LLM Agent leverages the in-context learning (ICL) capability of LLMs [23].
However, the efectiveness of the generated output depends heavily on the quality of the
prompt [24]. In our system, we designed a prompt template, which is populated with information
retrieved by the dynamic context retrieval module, following established best practices [25].
These ensure that the task is clearly defined, relevant contextual information is included,
demonstrations are provided, and using a model-friendly format style. The prompt consists of
both static and dynamically retrieved components and is shown in Figure 36. The invariable
sections, highlighted in blue, include (i) a system header that defines the agent’s expertise, (ii)
a goal description outlining the expected output, (iii) a specification of the structure of data
service documentation, and (iv) a set of guidelines that the model must follow when generating
its response. The dynamic sections, marked in yellow, are retrieved by the dynamic context
retrieval module and contain (i) the set of data services relevant to answering the query and
(ii) a selection of example queries with their corresponding pipelines, which serve as few-shot
demonstrations. Finally, the user’s input query, shown in red, is integrated into the prompt to
specify the problem to be solved.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Experimental Validation</title>
      <p>To evaluate our approach, we adapted a data service repository from a proprietary codebase
used in a real-world cardboard manufacturing pilot. For experimentation, service interactions
with physical assets were simulated rather than executed on actual devices. The repository
contained 12 data services. We also manually defined five queries ( q0–q4), each paired with a
corresponding solved pipeline serving as ground truth. These queries, suggested by factory</p>
      <sec id="sec-5-1">
        <title>4https://github.com/docarray/docarray</title>
        <p>5We use  = 1 in our experiments.
6The full prompt is available at https://github.com/jermathew/COSMADS/blob/main/src/pipeline_chain.py
Prompt template
operators, were rephrased into 10 variants using an LLM to introduce diversity. The queries
were designed with increasing complexity, from simple (q0) to complex (q4), based on the
number and type of data services involved. Each was ensured to have at least one similar query
and pipeline in the repository for retrieval during evaluation.</p>
        <p>Evaluation details. We assessed the quality of the tables generated by our approach by
comparing them to ground truth data produced from manually written Python scripts. The
evaluation was performed at two levels: intentional (schema-level) and extensional (data-level).
At the intentional level, we compared the structure of the generated tables with the expected
schema, representing the correct relational definition. Schema matching was conducted using
the Valentine tool7[26], based on the COMA instance-based method [27]. Precision and recall
were used to assess schema quality: high precision indicates few incorrect columns (false
positives), while high recall reflects the inclusion of most expected columns (low false negatives).
Since rephrased queries can lead to varying column names, the matching method accounts for
such variations. At the extensional level, we measured the correctness of the data in matched
columns using two metrics: Accuracy (cell) and Accuracy (row). These capture, respectively, the
proportion of correct values at the cell and row level. Importantly, accuracy is computed only
over matched columns, meaning high accuracy scores can still be achieved even with lower
precision or recall, as long as the content of matched columns is correct.</p>
        <p>Evaluation results. The results of our evaluation are summarized in Table 1, with values
averaged over the set of query variants. The findings reveal a decreasing trend in the measured
metrics as query complexity increases. While schema matching precision remains relatively
stable across diferent queries, recall drops significantly for q2 and q3. Upon manual inspection,
we observed that missing columns in the generated tables were often related to timestamps
used for defining time windows. In q2, despite some missing timestamp columns, accuracy
remains high, whereas in q3, errors primarily stem from incorrect computations of aggregated
results within time windows, leading to a lower accuracy score. The results for q4 show the
7Cf. https://github.com/delftdata/valentine
(a) W/o similar pipeline example – (a) version
(b) W/o pipeline example – (b) version
lowest overall performance. In this case, the increased complexity of data service composition
challenges our solution, leading to inconsistencies in the generated output. Manual analysis
revealed that in some cases, the generated tables contained correct data but were poorly
structured, for instance, using arrays or textual representations instead of numerical values.
Ablation study. To assess the impact of the dynamic context retrieval component on result
quality, we conducted an ablation study. The experiments were performed on the same set
of queries, considering two modified versions of our solution. In the first version, (a), instead
of providing the LLM Agent with similar query-pipeline examples, we replaced them with
unrelated query-pipeline pairs. In the second version, (b), we completely removed
querypipeline examples from the prompt. The results of these two settings are reported in Table 2a
and Table 2b, respectively. Both configurations lead to worse performance compared to Table 1,
underscoring the importance of query-pipeline few-shot examples in guiding the LLM Agent.
Interestingly, version (a), which replaces relevant examples with unrelated ones, does not
perform as poorly as one might expect. This suggests that even in an initial deployment phase,
where a repository of relevant query-pipeline examples may not yet be available, our solution
can still generate reasonably accurate results.</p>
        <p>Baseline: GitHub Copilot. We compared our system to an end-to-end baseline using a
code-generating LLM, GitHub Copilot8. Copilot was prompted to access the documentation
of the data services and generate a JSON file containing the tabular data as a response to the
query. The evaluation was conducted using Copilot’s chat mode within Visual Studio Code9.
Given a workspace containing the set of implemented tools, we invoked the @workspace
agent, which employs a meta-prompt to determine relevant information from the workspace</p>
      </sec>
      <sec id="sec-5-2">
        <title>8Cf. https://github.com/features/copilot/ 9Cf. https://code.visualstudio.com/docs/copilot/overview.</title>
        <p>to assist in answering the query. The results, reported in Table 3, show that while Copilot is
capable of generating tables for simpler queries, its performance degrades as query complexity
increases. Interestingly, in some cases, Copilot outperforms our approach, likely due to its
specialized training on code generation, which gives it an advantage over GPT-4 in certain
scenarios. However, integrating Copilot into an automated workflow remains a challenge, as
its web APIs are not publicly accessible. Nonetheless, the results suggest that replacing GPT-4
with Copilot within our solution could further enhance performance.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Concluding Remarks</title>
      <p>In this paper we presented a tool that generates Python scripts from operator queries by
leveraging existing data sources to produce tabular outputs. Evaluation on a real-world case
study shows that incorporating data service descriptions and prior pipelines improves accuracy
over state-of-the-art code generation tools lacking such context. A key challenge lies in ensuring
high-quality service documentation, which directly afects LLM Agent performance. While
automatic documentation techniques [28] ofer promise, enabling the LLM to reliably interpret
and apply services remains an open issue, potentially addressable via service profiling or
human-in-the-loop refinement [ 29]. Pipeline generation also poses challenges. Although our
system produces pipelines in a single step [30], iterative strategies using Chain-of-Thought
reasoning [31] and self-reflection [ 32, 33, 34] could improve quality. Previewing the resulting
table could help catch errors early. Finally, direct execution introduces risks; pipeline simulation
using digital twins [35] could ofer a safer testing environment.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>The work of Flavia Monti was supported by the MISE agreement on “Agile&amp;Secure Digital Twins
(A&amp;SDT)”. Jerin George Mathew was financed by the Italian National PhD Program in AI. The work of Donatella
Firmani has been partially supported by the HORIZON Research and Innovation Action 101135576
INTEND “Intent-based data operation in the computing continuum”. The work of Federica Mandreoli
was partially funded by the Horizon Europe project “WASABI: White-label shop for digital intelligent
assistance and human-AI collaboration in manufacturing” (GA No. 101092176). The work of Massimo
Mecella and Francesco Leotta was partially funded by MICS (Made in Italy—Circular and Sustainable)
(PE00000004) Extended Partnership (CUP B53C22004130001) funded by the EU - NextGeneration EU
PNRR MUR.</p>
    </sec>
    <sec id="sec-8">
      <title>Declaration on Generative AI</title>
      <sec id="sec-8-1">
        <title>The authors have not employed any Generative AI tools.</title>
        <p>[21] T. Ridnik, D. Kredo, I. Friedman, Code generation with alphacodium: From prompt engineering to
lfow engineering, arXiv preprint arXiv:2401.08500 (2024).
[22] T. Oinn, M. Addis, J. Ferris, D. Marvin, M. Senger, M. Greenwood, T. Carver, K. Glover, M. R. Pocock,
A. Wipat, P. Li, Taverna: a tool for the composition and enactment of bioinformatics workflows,
Bioinformatics 20 (2004) 3045–3054.
[23] T. Brown, B. Mann, N. Ryder, M. Subbiah, J. D. Kaplan, P. Dhariwal, A. Neelakantan, P. Shyam,</p>
        <p>G. Sastry, A. Askell, et al., Language models are few-shot learners, NeurIPS 2020 (2020).
[24] J. White, Q. Fu, S. Hays, M. Sandborn, C. Olea, H. Gilbert, A. Elnashar, J. Spencer-Smith, D. C.</p>
        <p>Schmidt, A prompt pattern catalog to enhance prompt engineering with chatgpt, arXiv preprint
arXiv:2302.11382 (2023).
[25] W. X. Zhao, K. Zhou, J. Li, T. Tang, X. Wang, Y. Hou, Y. Min, B. Zhang, J. Zhang, Z. Dong, et al., A
survey of large language models, arXiv preprint arXiv:2303.18223 (2023).
[26] C. Koutras, G. Siachamis, A. Ionescu, K. Psarakis, J. Brons, M. Fragkoulis, C. Lofi, A. Bonifati,
A. Katsifodimos, Valentine: Evaluating matching techniques for dataset discovery, in: ICDE, IEEE,
2021, pp. 468–479.
[27] H.-H. Do, E. Rahm, Coma—a system for flexible combination of schema matching approaches, in:</p>
        <p>VLDB Proceedings, Elsevier, 2002, pp. 610–621.
[28] J. Y. Khan, G. Uddin, Automatic code documentation generation using gpt-3, in: ASE, 2022.
[29] B. Wang, H. Fang, J. Eisner, B. Van Durme, Y. Su, Llms in the imaginarium: tool learning through
simulated trial and error, arXiv preprint arXiv:2403.04746 (2024).
[30] L. Wang, W. Xu, Y. Lan, Z. Hu, Y. Lan, R. K.-W. Lee, E.-P. Lim, Plan-and-solve prompting: Improving
zero-shot chain-of-thought reasoning by large language models, arXiv preprint arXiv:2305.04091
(2023).
[31] J. Wei, X. Wang, D. Schuurmans, M. Bosma, F. Xia, E. Chi, Q. V. Le, D. Zhou, et al., Chain-of-thought
prompting elicits reasoning in large language models, Advances in neural information processing
systems 35 (2022) 24824–24837.
[32] S. Yao, J. Zhao, D. Yu, N. Du, I. Shafran, K. R. Narasimhan, Y. Cao, React: Synergizing reasoning
and acting in language models, in: ICLR, 2022.
[33] N. Shinn, F. Cassano, A. Gopinath, K. Narasimhan, S. Yao, Reflexion: Language agents with verbal
reinforcement learning, Advances in Neural Information Processing Systems 36 (2024).
[34] H. Liu, C. Sferrazza, P. Abbeel, Chain of hindsight aligns language models with feedback, arXiv
preprint arXiv:2302.02676 (2023).
[35] C. Lo, C.-H. Chen, R. Y. Zhong, A review of digital twin in product design and development,
Advanced Engineering Informatics 48 (2021) 101297.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>G.</given-names>
            <surname>Yilmaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Qurban</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kaiser</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>McFarlane</surname>
          </string-name>
          ,
          <article-title>Cost-efective digital transformation of smes through low-cost digital solutions</article-title>
          ,
          <source>LoDiSA</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Colabianchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tedeschi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Costantino</surname>
          </string-name>
          ,
          <article-title>Human-technology integration with industrial conversational agents: A conceptual architecture and a taxonomy for manufacturing</article-title>
          ,
          <source>JIII</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>C.-Y.</given-names>
            <surname>Hsieh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.-A.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.-L. Li</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Fujii</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Ratner</surname>
            ,
            <given-names>C.-Y.</given-names>
          </string-name>
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Krishna</surname>
          </string-name>
          , T. Pfister,
          <article-title>Tool documentation enables zero-shot tool-usage with large language models</article-title>
          ,
          <source>arXiv preprint arXiv:2308.00675</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J. G.</given-names>
            <surname>Mathew</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Monti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Firmani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Leotta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Mandreoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mecella</surname>
          </string-name>
          ,
          <article-title>Composing smart data services in shop floors through large language models</article-title>
          ,
          <source>in: International Conference on ServiceOriented Computing</source>
          , Springer,
          <year>2024</year>
          , pp.
          <fpage>287</fpage>
          -
          <lpage>296</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>K.</given-names>
            <surname>Afolter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Stockinger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bernstein</surname>
          </string-name>
          ,
          <article-title>A comparative survey of recent natural language interfaces for databases</article-title>
          ,
          <source>The VLDB Journal</source>
          <volume>28</volume>
          (
          <year>2019</year>
          )
          <fpage>793</fpage>
          -
          <lpage>819</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>G.</given-names>
            <surname>Katsogiannis-Meimarakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Koutrika</surname>
          </string-name>
          ,
          <article-title>A survey on deep learning approaches for text-to-sql,</article-title>
          <source>VLDB J</source>
          .
          <volume>32</volume>
          (
          <year>2023</year>
          )
          <fpage>905</fpage>
          -
          <lpage>936</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.-L. Li</surname>
            ,
            <given-names>J. M.</given-names>
          </string-name>
          <string-name>
            <surname>Eisenschlos</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Perot</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Miculicich</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Fujii</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Shang</surname>
            ,
            <given-names>C.-Y.</given-names>
          </string-name>
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Pfister</surname>
          </string-name>
          ,
          <article-title>Chain-of-table: Evolving tables in the reasoning chain for table understanding</article-title>
          ,
          <source>ICLR</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>P.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          , S. Han,
          <string-name>
            <surname>D</surname>
          </string-name>
          . Zhang, Insightpilot:
          <article-title>An llm-empowered automated data exploration system</article-title>
          ,
          <source>in: EMNLP</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>346</fpage>
          -
          <lpage>352</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>R. C.</given-names>
            <surname>Fernandez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. J.</given-names>
            <surname>Elmore</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Franklin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Krishnan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <article-title>How large language models will disrupt data management</article-title>
          ,
          <source>VLDB Proceedings</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
            <surname>Saeed</surname>
          </string-name>
          , N. De Cao, P. Papotti,
          <article-title>Querying large language models with sql</article-title>
          ,
          <source>arXiv preprint arXiv:2304.00472</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Parisi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Fiedel</surname>
          </string-name>
          ,
          <article-title>Talm: Tool augmented language models</article-title>
          ,
          <source>arXiv preprint arXiv:2205.12255</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>D.</given-names>
            <surname>Berardi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Calvanese</surname>
          </string-name>
          , G. De Giacomo,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lenzerini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mecella</surname>
          </string-name>
          ,
          <article-title>Automatic service composition based on behavioral descriptions</article-title>
          ,
          <source>IJCIS</source>
          <volume>14</volume>
          (
          <year>2005</year>
          )
          <fpage>333</fpage>
          -
          <lpage>376</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>F.</given-names>
            <surname>Monti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Leotta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mangler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mecella</surname>
          </string-name>
          , S. Rinderle-Ma,
          <article-title>Nl2processops: Towards llm-guided code generation for process execution</article-title>
          ,
          <source>in: BPM</source>
          , Springer,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>R. D.</given-names>
            <surname>Pesl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Stötzner</surname>
          </string-name>
          , I. Georgievski,
          <string-name>
            <given-names>M.</given-names>
            <surname>Aiello</surname>
          </string-name>
          ,
          <article-title>Uncovering llms for service-composition: Challenges and opportunities</article-title>
          , in: ICSOC, Springer,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>M.</given-names>
            <surname>Aiello</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Georgievski</surname>
          </string-name>
          ,
          <article-title>Service composition in the chatgpt era</article-title>
          ,
          <source>SOCA</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Yi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          , et al.,
          <article-title>A survey on evaluation of large language models</article-title>
          ,
          <source>TIST</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>N.</given-names>
            <surname>Chirkova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Troshin</surname>
          </string-name>
          ,
          <article-title>Empirical study of transformers for source code</article-title>
          ,
          <source>in: Proceedings of ESEC/FSE</source>
          <year>2021</year>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kushman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schrittwieser</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Leblond</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Eccles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Keeling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Gimeno</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Dal</given-names>
            <surname>Lago</surname>
          </string-name>
          , et al.,
          <article-title>Competition-level code generation with alphacode</article-title>
          ,
          <source>Science</source>
          <volume>378</volume>
          (
          <year>2022</year>
          )
          <fpage>1092</fpage>
          -
          <lpage>1097</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>W.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. W.</given-names>
            <surname>Cohen</surname>
          </string-name>
          ,
          <article-title>Program of thoughts prompting: Disentangling computation from reasoning for numerical reasoning tasks</article-title>
          ,
          <source>arXiv preprint arXiv:2211.12588</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tworek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Jun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. P. d. O.</given-names>
            <surname>Pinto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kaplan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Edwards</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Burda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Joseph</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Brockman</surname>
          </string-name>
          , et al.,
          <source>Evaluating large language models trained on code, arXiv preprint arXiv:2107.03374</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>