<!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>
      <journal-title-group>
        <journal-title>Journal of Chiropractic Medicine 15 (2016). doi:10.1016/j.jcm.2016.02.012.
[28] MistralAI</journal-title>
      </journal-title-group>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.1007/978</article-id>
      <title-group>
        <article-title>Gap: LLMs, Competency Questions, and the Non-Technical User in the Humanities Domain</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Claire McNamara</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lucy Hederman</string-name>
          <email>hederman@tcd.ie</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Declan O'Sullivan</string-name>
          <email>declan.osullivan@adaptcentre.ie</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Workshop</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>ADAPT Centre for Digital Content, Trinity College Dublin</institution>
          ,
          <country country="IE">Ireland</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Knowledge Graph Exploration, Competency Questions, Large Language Models, Non-Technical Users</institution>
          ,
          <addr-line>Initial</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Trinity College Dublin</institution>
          ,
          <country country="IE">Ireland</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>on Semantic Systems</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <volume>4825</volume>
      <fpage>11</fpage>
      <lpage>15</lpage>
      <abstract>
        <p>Non-technical users often face a significant barrier when first attempting to explore complex knowledge graphs (KGs). We define this challenge as the Initial Exploration Problem, characterised by three interrelated barriers: ontology opacity, query incapacity, and scope uncertainty. This paper investigates how large language models (LLMs) can support domain experts in addressing this problem by automatically generating template-style competency questions (CQs) for the Virtual Record Treasury of Ireland (VRTI) KG. These templates are not user-facing themselves, but serve as scafolding for creating curated questions (CuQs), expert-validated, natural language questions that help new users begin meaningfully exploring the graph. We evaluate two LLMs (GPT-4o and Gemini 2.0 Flash) across twelve prompt configurations varying in scope and framing, and assess question quality using both semantic similarity to expert-authored CQs and detailed expert review. Our findings highlight how prompt design influences LLM output, and underscore the value of combining automated generation with expert curation. Ultimately, we propose a practical pipeline to support the creation of exploratory entry points tailored to user needs, helping domain experts craft better questions, and helping users take their first steps into meaningful KG exploration.</p>
      </abstract>
      <kwd-group>
        <kwd>Humanities Domain</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        A Knowledge Graph (KG), as defined by Hogan et al. in 2021 [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], is “a graph of data intended to
accumulate and convey knowledge of the real world, whose nodes represent entities of interest and
whose edges represent relations between these entities”. KG technologies have generated a diverse
range of research topics over the last two decades, from event-based networking [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], to more recently
their security [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. However, by far the most common deployment has been for data integration, as it
is a powerful way of representing the connections between information across diverse datasets, such
as those found in the humanities, that would ordinarily remain separate. It afords those interested
in the humanities the potential to identify patterns in data that may not be otherwise obvious when
exploring such datasets through more traditional forms (e.g., CSV, NoSQL) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Utilising the W3C
Resource Description Framework (RDF) model [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], it is possible to represent the links between data
across the datasets in a machine-readable format (RDF triples), thereby functionally combining the KG
datasets in a meaningful way. The associated query language, SPARQL [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], can then be used over the
RDF to return answers to questions users may have about the information in the dataset.
      </p>
      <p>
        However, a significant challenge arises when non-technical people attempt to explore an unfamiliar
humanities KG [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. This challenge, which we define as the Initial Exploration Problem, describes the
dificulty faced by non-technical individuals who do not know where to begin when confronted with a
large, complex, and unfamiliar KG. To our knowledge, while this problem has been addressed implicitly
in recent work [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], it has not yet been formally defined in the literature.
      </p>
      <p>CEUR</p>
      <p>ceur-ws.org</p>
      <p>
        The Initial Exploration Problem is characterised by three interrelated dificulties:
1. Ontology Opacity: Inability to interpret class/property terms and hierarchies (e.g., abstract event
types such as E13_Attribute_Assignment or E65_Creation from the CIDOC CRM ontology
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], a widely used ontology standard in cultural heritage domains).
2. Query Incapacity: Lack of skills to formulate structured queries using formal query languages
such as SPARQL [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
3. Scope Uncertainty: No prior awareness of what questions the KG can answer. This is not simply
a matter of vague search intent or query refinement, as in traditional exploratory search [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], nor
is it addressed by standard usability solutions. Rather, it is a problem of orientation: the user may
not know what kinds of questions are answerable, how the data is structured, or where to begin
their exploration.
      </p>
      <p>
        This gap presents a substantial barrier to new users engaging with KGs like the Virtual Record
Treasury of Ireland (VRTI) [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] KG [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], which is the focus of our experiment. The VRTI KG provides a
strong use case for this experiment as it currently contains over 2.7 million triples and is constructed
using complex ontologies such as CIDOC CRM [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], GeoSPARQL [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], and its own domain-specific VRTI
ontology [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Previous studies have shown that without a clear understanding of the information
stored in the KG [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] or the technical skills to create and execute SPARQL queries [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ][
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], those
interested in the humanities often struggle to explore the data efectively.
      </p>
      <p>
        Tús Maith (/tuːs ˈmˠah/), coming from the Irish saying “Tús Maith Leath na hOibre” (“a good start is
half the work”), is a framework designed to address the Initial Exploration Problem. A key component of
Tús Maith is the concept of curated questions (CuQ). In this context, CuQs are a set of predefined natural
language questions curated by a domain expert to guide new users in beginning their exploration of
the KG. These questions act as a set of exploration starting points for new users while also giving them
an understanding of the types of questions the KG is able to answer. As will be explained in Section 2, a
past experiment carried out by the authors found that CuQs show promise when used in this context.
These CuQs are conceptually linked to competency questions (CQs), which are traditionally used in
ontology engineering to define the requirements a knowledge base should be able to meet [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. While
CQs are typically designed to guide ontology development or evaluate knowledge completeness [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ],
in this work, they are adapted as a mechanism for supporting user exploration.
      </p>
      <p>
        This paper presents an experiment on the automatic generation of template-based CQs from the VRTI
KG using two popular Large Language Models (LLMs): ChatGPT-4o [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] and Gemini 2.0 Flash [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ].
These templates are not intended as final CuQs, but as an intermediate resource: structured natural
language forms grounded in the VRTI KG’s classes, properties, and, where they exist, relationships.
They are designed to be later filled with specific, commonly searched entities to produce fully-formed
questions suitable for non-technical users in an exploration interface. The aim is not to develop new
prompt engineering strategies or fine-tuning methods. Rather, its contribution lies in combining
previously separate research threads (LLM-based CQ generation and KG exploration techniques) and
applying them in a holistic way. Specifically, it explores how well a by-product of CQs can be repurposed
as a solution to the Initial Exploration Problem.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Tús Maith</title>
      <p>As seen in Figure 1, the template-style CQs are intended to support domain experts in crafting CuQs
that help users explore the scope and potential of the KG. The lifecycle of a question in this process
involves three stages:
1. Template-style competency question (CQ): A general template question generated by the</p>
      <p>LLM based on class/property input, e.g. ”Where was a person born?”.
2. Filled-in/generated question: A template-style CQ filled in automatically with popular entities
within the graph and/or entities the domain expert feels may be of interest, e.g. ”Where was Oscar
Wilde born?”.
3. Curated question (CuQ): The filled-in question accepted or refined by a domain expert for
presentation to users.</p>
      <p>
        Prior to the experiment outlined in this paper, a small-scale evaluation involving 12 participants was
conducted by the authors to assess the current user-facing components of Tús Maith. These components,
which were implemented within the VRTI Explorer interface [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], were CuQs and commonly searched
keywords, used in conjunction with a search bar. An example of how CuQs were presented can be
seen in Figure 2. The CuQs for this evaluation were created by a historical domain expert independent
of Tús Maith, who has been heavily involved in the development of the VRTI KG. This expert was
asked to formulate fiteen questions that they considered both interesting and illustrative of the VRTI
KG’s scope [21]. The results of the evaluation showed that three of the four participants who
selfidentified as having limited familiarity with the VRTI KG found the CuQs to be the most helpful feature
when beginning their exploration. While a further, larger-scale evaluation targeting more novice
users is needed to better assess the eficacy of CuQs in addressing the Initial Exploration Problem,
the preliminary findings were promising and motivated further investigation into scalable methods of
generating such questions.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Experiment Methodology</title>
      <p>This section outlines the design of the experiment and the two-step evaluation process that was followed
in order to explore the extent to which LLMs at default settings (temperature=1, top_p=1) can be used to
generate template-style CQs for the VRTI KG. The design was motivated by the methodology presented
in [22], which evaluated six LLMs across five RDF-based ontologies using zero- and few-shot prompting.
While our experiment involved only two LLMs, a greater variety of prompts was used (12 distinct
prompts as opposed to 6), and crucially, domain experts evaluated the output. The full results and code
are openly available at [21], [23] ensuring transparency and reproducibility.</p>
      <sec id="sec-3-1">
        <title>3.1. Prompt Design and Experimental Setup</title>
        <p>Twelve separate runs were conducted for each LLM, varying by prompt framing, shot type (one-shot or
few-shot), and input scope as seen in Table 1. Input scope options are discussed in section 4.2.
1. Prompt 1: Simply instructs the LLM to generate questions from provided classes and properties.
2. Prompt 2: Includes the assigning of a role to the LLM (historical knowledge graph exploration
assistant) to guide its generation strategy.</p>
        <p>Listing 1 shows the base prompt used for all LLM runs, with conditional sections annotated according
to experimental configurations (e.g., +Role, +Examples).</p>
        <p>Listing 1: Template-style competency question prompt with condition annotations.
# Template-style competency question prompt.
# Modular components annotated with experimental conditions.
#
------------------------------------------------------{INCLUDE_ROLE? You are a historical knowledge graph exploration assistant. Your task is to
generate natural language, template-style competency questions that ordinary users might ask
when exploring a historical knowledge graph.} [Condition(s): Prompt 2,
+Role]
I am providing you with a set of knowledge graph classes, properties {INCLUDE_RELATIONSHIPS? ,
and relationships}. Using only the provided information, generate 20 template-style
competency questions that could be asked about this ontology. [Condition(s): All;
relationships only in Subset and CIDOC CRM Relationships, +Relationships]
A competency question in this context is defined as a natural language question that helps
convey the scope and potential of a KG to users unfamiliar with its structure with the aim
of supporting exploration.
{INCLUDE_EXAMPLES? Examples of the type of questions I am looking for are: "Where was a person
born?", "When did a person die?", "What type of place is this?".} [Condition(s): Few Shot,
+Examples]
Phrase questions in natural, user-friendly language, avoiding technical or ontology-specific
terms e.g. use "was born" instead of "birth event".</p>
        <p>Use template-style phrasing: general questions with placeholders like "a person", "a place" etc.
Focus on creating general, reusable question templates that can later be filled with specific
instance data.</p>
        <p>Only use the given classes, properties {INCLUDE_RELATIONSHIPS? , and relationships}; do not
invent additional concepts. [Condition(s): All; relationships only in Subset and CIDOC
CRM Relationships, +Relationships]
You may combine classes and properties if it helps express a useful question.</p>
        <p>Phrase each competency question naturally, as if it were intended for a user exploring the
knowledge graph.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Data Preparation</title>
        <p>
          The VRTI KG integrates multiple ontologies, including CIDOC CRM [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], GeoSPARQL [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], and a custom
VRTI ontology [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], making it significantly more complex than single-schema KGs. CIDOC CRM,
in particular, is a formal ontology designed to represent cultural heritage information in rich detail,
featuring a dense network of abstract classes and properties that model events, entities, and relationships.
The resulting heterogeneity obtained through the use of multiple, often complex ontologies poses
additional challenges for natural language question generation, as many terms are either highly abstract
or domain-specific (e.g. P81b_begin_of_the_end). To explore whether diferent input scopes could
yield more interpretable and relevant questions, three variations of input term sets were tested across
prompt runs: the full set of classes and properties (48 classes, 198 properties) [21], a manually reduced
subset of 18 classes and 35 properties [21], and a third version of the subset that included CIDOC CRM
relationship information to the subset of classes and properties as prompt variables. The subset was
constructed by the authors to retain the most semantically expressive and user-relevant terms while
excluding overly technical entries, such as virtrdf#qmf01blankOfShortTmpl, which are poorly suited
to natural language articulation. The decision to extract classes and properties from instance data rather
than from the full ontology was intentional; not all ontology terms are currently used in the KG, and
this work aims to support exploratory access to available content, rather than exhaustively covering
the ontology itself.
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Evaluation Strategy</title>
        <p>This subsection outlines the two-step evaluation process undertaken by the authors. The first step
involved using SentenceBERT [24] to identify, for each LLM, the set of generated questions most
semantically similar to a ground truth set of CQs in order to filter the question sets from 24 to 2. In
the second step, those two question sets were analysed by domain experts with intimate knowledge
of the VRTI KG, evaluating them across three dimensions: relevance, clarity, and answerability. They
were also asked to evaluate whether the generated set of CQs contained questions that, in their opinion,
could be added to the ground truth question set.</p>
        <sec id="sec-3-3-1">
          <title>3.3.1. Step 1 - SentenceBERT Evaluation</title>
          <p>There is no existing benchmark CQ set for the VRTI KG. To establish a minimal ground truth, a historical
domain expert with direct involvement in the KG’s development was asked to create a set of CQs
[21]. Generated template-style CQs were first evaluated for semantic similarity to the expert-authored
ones with SentenceBERT using the all-mpnet-base-v2 sentence-transformer model [25] and compared
pairwise using cosine similarity.</p>
          <p>Let  ∈ ℝ ×</p>
          <p>represent the similarity matrix, where  is the number of generated questions and 
the number of expert-authored ones. Each element   corresponds to the similarity between the  -th
generated question and the  -th expert question.</p>
          <p>For each generated question, the maximum similarity to any expert question was calculated:
The average of these maximum similarity scores across all generated questions was then computed
as:
max = max</p>
          <p>1≤≤
max = 1
∑ max

∑ ( max ≥  )
where  is the indicator function. The percentage of generated questions exceeding the threshold is
In this experiment, a threshold of  = 0.6 was selected, following precedent established in prior
work evaluating LLM-generated CQs using SentenceBERT[22]. This value reflects a moderate level
of semantic alignment, capturing cases where generated questions are meaningfully similar to
expertauthored ones while avoiding overly lenient matches.</p>
        </sec>
        <sec id="sec-3-3-2">
          <title>3.3.2. Step 2 - Expert Evaluation</title>
          <p>While semantic similarity provides an automated means of filtering and ranking generated questions, it
does not assess important qualitative aspects such as interpretability, alignment with the KG’s intended
usage, or answerability using only the information found within the KG. To address this, a human
expert evaluation was conducted on a subset of the generated questions. Two historical domain experts,
both very familiar with the content and structure of the VRTI KG, were asked to evaluate a sample of
the LLM-generated questions. This sample comprised of one set of template-style CQs per LLM; the sets
of questions that achieved the highest average semantic similarity to the expert-authored ground truth
questions for each LLM out of the 12 prompt configurations described in Section 4.1. Each question
was evaluated independently by both experts using a 5-point Likert scale [26] across three dimensions:
1. Relevance: How well does the question align with the purpose of a CQ in this context? (1 = Not
relevant at all, 5 = Highly relevant)
= Very unclear or confusing, 5 = Very clear)
2. Clarity: Is the question phrased in a clear, unambiguous, and grammatically correct manner? (1
3. Answerability: Can the question be reasonably answered using information contained within
the VRTI KG? (1 = Not answerable at all, 5 = Fully answerable)</p>
          <p>These three dimensions were selected to reflect the practical requirements of template-style CQs
within the context of the Tús Maith pipeline; question templates that highlight the scope and potential of
a KG that can later be filled in with specific entity information.</p>
          <p>Relevance considers whether the question
aligns well with the definition of a template-style CQ. Clarity addresses interpretability, particularly for
non-technical users. Answerability considers whether the question can reasonably be answered using
only the information currently present in the KG.</p>
          <p>The experts were instructed to evaluate each question as a template, not a fully instantiated question.
In addition to scoring individual questions, the experts were also invited to reflect on whether any
questions present in the generated set but not in the original ground truth set could, in hindsight, be
considered template-style CQ candidates. This qualitative feedback was intended to identify whether
the LLM could highlight potential blind spots in the expert-authored ground truth CQs. Expert scores
were aggregated to provide average scores per dimension across each LLM-generated set. This enabled
comparison not only between individual questions but also between the two diferent LLMs used. This
evaluation stage was essential in order to identify whether either/both/or neither LLM could produce
not only semantically aligned questions with the ground-truth CQs, but ones that were perceived by
experts as meaningful, understandable, and practically useful in the context of supporting exploration
within a complex KG.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Results</title>
      <sec id="sec-4-1">
        <title>4.1. SentenceBERT Similarity Evaluation</title>
        <p>We first evaluated the similarity between 20 questions generated in each run and a set of 10 domain
expert-created ground truth questions using SentenceBERT. The metric used was maximum similarity
per question, with average values reported per run (Table 2). Across all runs, the highest-performing
runs were Run 6 (the few-shot prompt with a subset of the classes, properties and CIDOC CRM
relationship information) for GPT-4o, and Run 11 (the few-shot prompt with a role assigned and just
the subset of classes and properties) for Gemini 2.0 Flash. The best run for GPT achieved an average
max similarity of 0.418 (20% ≥ 0.6), while the best for Gemini achieved 0.480 (25% ≥ 0.6), indicating a
closer lexical and semantic match to the expert-authored questions.</p>
        <p>Notably, runs with access to CIDOC CRM relationship data (runs 3, 6, 9, and 12) did not consistently
outperform others, and runs provided with the full set of classes and properties tended to
underperform. This may suggest that narrowing the input scope to a manually filtered subset, without CIDOC
CRM relationship data, helps steer LLM generation toward more meaningful or semantically focused
questions.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Domain Expert Evaluation</title>
        <p>For step two, the domain expert evaluation, question sets generated by runs 6 (GPT) and 11 (Gemini), the
highest-scoring runs in Table 2, were used. Two domain experts independently expressed their judgment
on these question sets, rating each individual question via an online questionnaire1 on relevance, clarity,
and answerability using a 1-5 Likert scale. They were also asked whether any questions in the generated
sets could be added to the ground truth set, to select which question set they preferred overall, and to
provide free-text comments. The experts were not told which question set was generated by which
LLM. The average scores and quantitative analysis of these scores across both experts are summarised
in Table 3. The full set of results can be found here [21], and the code used to analyse the results can be
found here [23].</p>
        <p>While the GPT-generated question set scored slightly higher in average relevance and clarity, the
Gemini-generated question set outperformed it in answerability, based on mean ratings across both
experts. Inter-rater reliability varied significantly across dimensions and LLMs. For relevance, both
models showed extremely low agreement between raters, with intraclass correlation coeficients (ICCs)
close to zero or even negative (GPT ICC3k = –0.015, Gemini ICC3k = 0.144), indicating substantial
subjectivity in how relevance was interpreted. This is further reflected in the high standard deviations
1Full questionnaire: https://forms.gle/SPcFTR8ruxp1DfUD7. This demo version no longer collects responses.
(up to 2.038 for GPT), suggesting that domain experts varied widely in their opinion on how well the
questions align with the purpose of a CQ in the context of Tús Maith (relevance). In contrast, GPT
achieved strong inter-rater agreement for both clarity (ICC3k = 0.839) and answerability (ICC3k =
0.839), accompanied by comparatively lower standard deviations, indicating more consistent scoring
and tighter consensus among experts. Gemini exhibited moderate reliability (clarity ICC3k = 0.539;
answerability ICC3k = 0.671) but showed greater variability in scores, especially for answerability,
where standard deviations reached 2.159 for domain expert 1. These combined metrics, ICCs capturing
rating agreement between the domain experts, the average rating given by them to the generated
question sets across the three criteria, and standard deviations indicating score dispersion, highlight
the nuanced trade-ofs between average performance and consistency of expert assessments, which is
critical in qualitative evaluations with subjective criteria.</p>
        <p>Expert ratings reflected common patterns: questions rated poorly typically contained ambiguous
wording or technical jargon that obscured their intent and reduced accessibility for non-technical users.
In contrast, highly rated questions were clear, focused on meaningful historical information, and aligned
well with the VRTI KG, making them both understandable and answerable. However, these findings
also highlight the need to analyse questions comprehensively across all three dimensions rather than
focusing on any single criterion. For example, some questions, such as “What is the relationship between
a group and a person?”, were rated highly for relevance and clarity by both domain experts but scored
lower on answerability due to it referring to information not explicitly contained within the VRTI KG.
This underscores that a balance across all dimensions is essential for a question to function well as a
template-style CQ. Table 4 presents paired examples of questions across all three evaluation dimensions
(Relevance, Clarity, Answerability), showing examples of both the lowest-rated (≤2/5) and highest-rated
(≥4/5) questions where both domain experts agreed in their assessments.</p>
        <p>Expert comments ofer important qualitative insights. While both models generated syntactically
valid questions, they were often overly complex or used domain-specific jargon unsuited to non-technical
users, for example, “What type of attribute assignment was carried out?”. One expert observed that
Gemini’s questions, although still technical, were easier to interpret and more closely matched the
structure and content of the VRTI KG. This likely contributed to both experts ultimately preferring the
Gemini-generated set. A notable outcome of the evaluation is that each expert identified at least one
Gemini question that could be added to the ground truth CQ set, and one expert did so for GPT. An
example of a question a domain expert that found could be added is ”What title does a person have?”.
This indicates that LLM-generated questions, despite the current limitations, can reveal potential gaps
in manually constructed question templates.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Comparative Insights</title>
        <p>The comparison between SentenceBERT similarity and expert judgment reveals both alignment and
divergence. GPT, despite slightly lower SentenceBERT similarity than Gemini, was rated more relevant
and clear but less answerable. This suggests that it may generate more ambitious or abstract questions.
Conversely, Gemini’s higher similarity and answerability scores indicate that it may produce questions
closer to the current graph content and better suited to near-term user exploration needs. An important
confounding factor may be KG class coverage. 7 of 10 (70%) expert ground truth questions were person
entity related, whereas only 9 of 20 (45%) Gemini questions and 10 of 20 (50%) GPT questions in their
respective best runs referred to people. Future work could investigate whether providing the LLM with
class coverage ratios that reflect the most frequent entity types in the KG leads to improved question
generation results.</p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Summary</title>
        <p>Overall, the results highlight that while LLMs can generate semantically rich and partially relevant CQs,
there is a trade-of between semantic similarity, readability, and groundedness in the graph. Narrowing
input scope and including few-shot examples improved performance, and SentenceBERT evaluation
aligned in part with expert assessments. However, inter-rater reliability metrics revealed variation
in how experts interpreted key criteria like relevance, underscoring the need for clearer evaluation
rubrics for domain experts to follow. While some subjectivity is inevitable, even among domain experts
working in the same area provided with a clearer rubric, relevance still remains a valuable criterion
as it is one that situates the question within the specific context of template-style CQs, in ways that
clarity and answerability alone cannot capture. Further tuning is also needed to ensure the LLM output
is suitable for non-expert end users and targeted toward the graph content as it exists currently.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Limitations and Future Work</title>
      <p>This experiment presents an initial investigation into the use of LLMs for generating template-style
CQs to support exploration of the VRTI KG. However, several limitations must be acknowledged.</p>
      <p>Firstly, only two LLMs, GPT-4o and Gemini 2.0 Flash, were tested, both using their default settings.
As these are commercial models, the prompts were executed via standard API access. Ethical and
licensing considerations for such systems are relevant but were not a concern in this case due to the
public nature of the VRTI KG. While these are among the most capable publicly available models, future
work could explore open-source alternatives such as Mistral [28] or LLaMA 4 [29], which may ofer
greater customisability or domain-specific fine-tuning. Expanding the range of models evaluated would
provide a clearer picture of how model architecture and access conditions influence output quality.</p>
      <p>Secondly, the evaluation involved only two domain experts. Although their feedback was detailed
and constructive, a larger and more diverse pool of reviewers would allow for a more reliable assessment
of the questions’ practical relevance, clarity, and answerability. Scaling up this aspect of the study
would strengthen the validity of the findings and help identify consistent patterns in expert preference.
Additionally, while the clarity criterion, like the others, implicitly includes multiple subcomponents (e.g.,
grammar, ambiguity, phrasing), no formal rubric was used to disaggregate or define these dimensions.
The evaluation instead reflects common humanities practice, where expert interpretation and contextual
judgment are often more appropriate than rigid scoring frameworks [ 30]. Nonetheless, future work
may benefit from developing standardised evaluation rubrics to support clearer comparisons across
datasets, models, and evaluators.</p>
      <p>Thirdly, further analysis needs to be carried out on whether or not the generated questions can be
translated into SPARQL without augmentation. Fourthly, while this study focuses on the early stages
of the Tús Maith pipeline, namely, the automatic generation and expert review of question templates, it
does not yet evaluate how these questions, when instantiated and validated by domain experts, perform
when integrated into the VRTI Explorer interface. A natural next step is to assess the efectiveness
of these questions in situ, especially in supporting non-technical users’ early-stage exploration of the
graph. Measuring user engagement, comprehension, and exploratory behaviour in response to these
questions could ofer valuable insights into their practical impact.</p>
      <p>Finally, while the VRTI KG ofers a rich and historically grounded test case, generalisability remains
an open question. Future work could explore the application of Tús Maith to other types of KGs. Generic
KGs such as DBpedia [31] would ofer breadth, but a more meaningful test of the framework’s relevance
would involve similarly complex and semantically rich graphs in the humanities domain. This would
better reflect the kinds of exploratory challenges Tús Maith is designed to address.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Related Work</title>
      <p>A number of recent studies have investigated the use of LLMs in order to generate CQs from KGs,
though often with diferent aims and assumptions than those guiding this work.</p>
      <p>RevOnt [32] explores the reverse engineering of CQs from KGs such as Wikidata, drawing on a set
of human-authored CQs from existing corpora as ground truth for evaluating output quality. Their
definition of a CQ, “a typical query that an expert might want to submit to a knowledge base of its
target domain, for a certain task”, reflects a focus on ontology modelling and evaluation. In contrast,
this experiment defines a CQ as a natural language question that helps convey the scope and potential
of a KG to users unfamiliar with its structure, with the aim of supporting exploration rather than formal
assessment. Moreover, RevOnt assumes the availability of triple verbalisations, a condition that does
not hold for the VRTI KG, which contains over 2.7 million non-verbalised triples and makes the RevOnt
pipeline non-transferable to this context.</p>
      <p>Other work [33] focuses on generating CQs from KGs constructed from PDF documents. After
clustering similar entities and generating summaries, CQs are produced from these summaries and
evaluated using zero- and few-shot prompting with cosine similarity scores. However, this introduces a
degree of circularity by using the summary to both generate and evaluate the questions. Their work
also took an LLM-as-a-judge evaluation approach without the involvement of domain experts, while
in contrast, this experiment employs human expert evaluation to assess the quality, relevance, and
answerability of generated CQs.</p>
      <p>A related line of work by Alharbi et al. spans two papers: the first retrofits CQs to existing ontologies
by prompting LLMs to generate multiple questions per triple [34], and the second extends this with an
analysis of model settings and prompt design strategies across LLMs [35]. Both papers are motivated by
the needs of ontology engineers, aiming to support ontology testing, reuse, and design evaluation rather
than exploratory search. While methodologically thorough, both studies are situated within ontology
engineering workflows and do not integrate expert-led curation or address the needs of non-technical
users. However, their exploration of varied prompt formulations supports the hypothesis also under
investigation in this paper, that LLMs may behave diferently when cast into specific roles.</p>
      <p>
        While surveys such as [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] comprehensively cover tools for KG exploration, they overlook the initial
entry barriers non-technical users face, barriers our work aims to address. Recent benchmarks like
Bench4KE [36] focus on automated CQ generation to evaluate ontology quality. In contrast, our
approach (1) generates exploratory scafold CQs tailored for non-technical users, and (2) embeds expert
curation to ensure usability. This second point is especially crucial in complex, humanities-based graphs
like VRTI, where ontology complexity compounds the Initial Exploration Problem.
      </p>
      <p>Lastly, recent work on CQ benchmarking [37] provides criteria for evaluating CQ quality across
syntactic, semantic, and domain-specific dimensions, including SPARQL transformability. While useful
as background for designing evaluation strategies, these frameworks are not yet widely adopted and
assume the existence of a ground truth CQ set, which, up until this experiment, did not exist for the
VRTI KG.</p>
    </sec>
    <sec id="sec-7">
      <title>7. Conclusions</title>
      <p>This paper has presented Tús Maith as a potential solution to the Initial Exploration Problem, a challenge
formally defined here as the set of barriers non-technical users face when first attempting to explore
complex KGs. It has also explored the application of LLMs to the generation of CQ templates for a
complex historical KG, with the aim of integrating them into the Tús Maith pipeline. KGs such as
the VRTI KG, which contains over 2.7 million RDF triples and has been constructed using a variety
of often complex ontologies, are typically too large and intricate for domain experts to reasonably
recall all relevant classes, properties, and relationships needed to formulate a comprehensive set of
template-style CQs manually. In this context, LLMs serve as a cognitive aid, helping experts identify
plausible CQ templates that they feel reflect the structure and content of the graph. By combining
prompt engineering with structured experimentation across two state-of-the-art LLMs, we have assessed
to what extent LLMs can generate CQs to support Tús Maith. Our findings show that, with minimal
input, LLMs can generate a promising number of relevant, clear, and answerable questions, particularly
when provided with a reduced number of classes and properties and few-shot examples. However,
diferences in model behaviour, input scope, and prompt design influence output quality. Domain expert
evaluation highlighted the potential of LLM-assisted question generation as a curatorial aid, but also
underscored the need for expert oversight in validating and refining outputs. Future work will include
extending the CQ evaluation using a clearer criteria rubric across a broader pool of experts, performing
an end-to-end evaluation of the Tús Maith pipeline in practice, and investigating its generalisability
to other similarly complex KGs. Ultimately, this work supports a vision of a semi-automated curation
pipeline that blends LLM-generated scafolding with domain expertise, enabling non-technical end
users access to exploration starting points to complex KGs in the humanities domain.</p>
    </sec>
    <sec id="sec-8">
      <title>Acknowledgments</title>
      <p>The research conducted in this publication was funded by the Irish Research Council under project ID
GOIPG/2021/1165 and supported by the Research Ireland ADAPT Centre for Digital Content Technology
(grant number 13/RC/2106_P2).</p>
    </sec>
    <sec id="sec-9">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the author(s) used Chat-GPT-4 in order to: Grammar and spelling
check. After using these tool(s)/service(s), the author(s) reviewed and edited the content as needed and
take(s) full responsibility for the publication’s content.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Hogan</surname>
          </string-name>
          , E. Blomqvist,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cochez</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>D'amato</article-title>
          , G. D.
          <string-name>
            <surname>Melo</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Gutierrez</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Kirrane</surname>
            ,
            <given-names>J. E. L.</given-names>
          </string-name>
          <string-name>
            <surname>Gayo</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Navigli</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Neumaier</surname>
            ,
            <given-names>A.-C. N.</given-names>
          </string-name>
          <string-name>
            <surname>Ngomo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Polleres</surname>
            ,
            <given-names>S. M.</given-names>
          </string-name>
          <string-name>
            <surname>Rashid</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rula</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Schmelzeisen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Sequeda</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Staab</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Zimmermann</surname>
          </string-name>
          ,
          <article-title>Knowledge graphs</article-title>
          ,
          <source>ACM Comput. Surv</source>
          .
          <volume>54</volume>
          (
          <year>2021</year>
          ). URL: https://doi.org/10.1145/3447772. doi:
          <volume>10</volume>
          .1145/3447772.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>D.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Keeney</surname>
          </string-name>
          ,
          <string-name>
            <surname>D. O'Sullivan</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Guo</surname>
          </string-name>
          ,
          <article-title>Towards a managed extensible control plane for knowledge-based networking</article-title>
          , in: R. State, S. van der Meer,
          <string-name>
            <surname>D. O'Sullivan</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          Pfeifer (Eds.),
          <source>Large Scale Management of Distributed Systems</source>
          , Springer Berlin Heidelberg, Berlin, Heidelberg,
          <year>2006</year>
          , pp.
          <fpage>98</fpage>
          -
          <lpage>111</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>P.</given-names>
            <surname>Bhardwaj</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Kelleher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Costabello</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          <article-title>O'Sullivan, Adversarial attacks on knowledge graph embeddings via instance attribution methods</article-title>
          ,
          <source>CoRR abs/2111</source>
          .03120 (
          <year>2021</year>
          ). URL: https: //arxiv.org/abs/2111.03120. arXiv:
          <volume>2111</volume>
          .
          <fpage>03120</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>RDF</surname>
          </string-name>
          ,
          <article-title>Resource description framework (rdf</article-title>
          ), http://www.w3.org/RDF/,
          <year>2014</year>
          . [Online; Accessed June 2025].
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>SPARQL</surname>
          </string-name>
          ,
          <article-title>Sparql query language for rdf</article-title>
          , https://www.w3.org/TR/sparql11-query/,
          <year>2013</year>
          . [Online; Accessed June 2025].
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>H.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Appleby</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Brumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Suh</surname>
          </string-name>
          ,
          <article-title>Knowledge graphs in practice: Characterizing their users, challenges, and visualization opportunities</article-title>
          ,
          <source>arXiv preprint arXiv:2304.01311</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>B.</given-names>
            <surname>Kantz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Innerebner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Waldert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Lengauer</surname>
          </string-name>
          , E. Lex, T. Schreck, Onset: Ontology and semantic exploration toolkit,
          <year>2025</year>
          . URL: https://arxiv.org/abs/2504.08373. arXiv:
          <volume>2504</volume>
          .
          <fpage>08373</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>M.</given-names>
            <surname>Doerr</surname>
          </string-name>
          ,
          <article-title>The cidoc conceptual reference module: an ontological approach to semantic interoperability of metadata</article-title>
          ,
          <source>AI Mag</source>
          .
          <volume>24</volume>
          (
          <year>2003</year>
          )
          <fpage>75</fpage>
          -
          <lpage>92</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Lissandrini</surname>
          </string-name>
          , T. B.
          <string-name>
            <surname>Pedersen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Hose</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Mottin</surname>
          </string-name>
          ,
          <article-title>Knowledge graph exploration: where are we and where are we going?</article-title>
          ,
          <source>SIGWEB Newsl</source>
          .
          <year>2020</year>
          (
          <year>2020</year>
          ). URL: https://doi.org/10.1145/3409481.3409485. doi:
          <volume>10</volume>
          .1145/3409481.3409485.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <article-title>Virtual Record Treasury of Ireland, Virtual Record Treasury of Ireland, Online resource</article-title>
          ,
          <year>2025</year>
          . URL: https://virtualtreasury.ie/, online;
          <source>Accessed June</source>
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <article-title>Virtual Record Treasury of Ireland, Knowledge graph</article-title>
          , Online resource,
          <year>2025</year>
          . URL: https:// virtualtreasury.ie/knowledge-graph,
          <source>online; Accessed June</source>
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>R.</given-names>
            <surname>Battle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kolas</surname>
          </string-name>
          ,
          <article-title>Geosparql: enabling a geospatial semantic web</article-title>
          ,
          <source>Semantic Web Journal</source>
          <volume>3</volume>
          (
          <year>2011</year>
          )
          <fpage>355</fpage>
          -
          <lpage>370</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>L.</given-names>
            <surname>McKenna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kilgallon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Randles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Yaman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Debruyne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Orlandi</surname>
          </string-name>
          , G. Munnelly,
          <string-name>
            <given-names>P.</given-names>
            <surname>Crooks</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          <article-title>O'Sullivan, Virtual Record Treasury of Ireland (VRTI) Ontology (v1.2), Web page</article-title>
          ,
          <year>2025</year>
          . URL: http://ont.virtualtreasury.ie/ontology/index-en.
          <source>html, revision v1.2</source>
          ,
          <string-name>
            <surname>Accessed</surname>
            <given-names>June</given-names>
          </string-name>
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Al-Tawil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Dimitrova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Thakker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Abu-Salih</surname>
          </string-name>
          ,
          <article-title>Emerging exploration strategies of knowledge graphs</article-title>
          ,
          <source>IEEE Access 11</source>
          (
          <year>2023</year>
          )
          <fpage>94713</fpage>
          -
          <lpage>94731</lpage>
          . doi:
          <volume>10</volume>
          .1109/ACCESS.
          <year>2023</year>
          .
          <volume>3308514</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>E.</given-names>
            <surname>Kuric</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fernández</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Drozd</surname>
          </string-name>
          ,
          <article-title>Knowledge graph exploration: A usability evaluation of query builders for laypeople</article-title>
          , in: M.
          <string-name>
            <surname>Acosta</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Cudré-Mauroux</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Maleshkova</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Pellegrini</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Sack</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Sure-Vetter</surname>
          </string-name>
          (Eds.),
          <source>Semantic Systems. The Power of AI and Knowledge Graphs. SEMANTiCS 2019, Lecture Notes in Computer Science</source>
          , Springer, Cham,
          <year>2019</year>
          . doi:
          <volume>10</volume>
          .1007/978- 3-
          <fpage>030</fpage>
          - 33220- 4_
          <fpage>24</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          , D. Han,
          <article-title>Kgnav: A knowledge graph navigational visual query system</article-title>
          ,
          <source>Proceedings of the VLDB Endowment</source>
          <volume>18</volume>
          (
          <year>2023</year>
          ). doi:https://doi.org/10.14778/3611540.3611592.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>G. K. Q.</given-names>
            <surname>Monfardini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Salamon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. P.</given-names>
            <surname>Barcellos</surname>
          </string-name>
          ,
          <article-title>Use of competency questions in ontology engineering: A survey</article-title>
          , in: J. P. A.
          <string-name>
            <surname>Almeida</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Borbinha</surname>
            , G. Guizzardi,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Link</surname>
          </string-name>
          , J. Zdravkovic (Eds.),
          <source>Conceptual Modeling</source>
          , Springer Nature Switzerland, Cham,
          <year>2023</year>
          , pp.
          <fpage>45</fpage>
          -
          <lpage>64</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>OpenAI</surname>
          </string-name>
          , Gpt-4o,
          <year>2024</year>
          . URL: https://platform.openai.com/docs/models/gpt-4o, online;
          <source>Accessed June</source>
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <source>[19] GoogleCloud, Gemini 2.0 flash</source>
          ,
          <year>2024</year>
          . URL: https://cloud.google.com/vertex-ai/generative-ai/docs/ models/gemini/2-0-flash,
          <source>online; Accessed June</source>
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>A.</given-names>
            <surname>Randles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>McKenna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kilgallon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Yaman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Crooks</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          <article-title>O'Sullivan, The knowledge graph explorer for the virtual record treasury of ireland</article-title>
          ,
          <source>in: Proceedings of the 9th International Work-</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>