pith. sign in

arxiv: 2606.08477 · v1 · pith:KJPEEQIUnew · submitted 2026-06-07 · 💻 cs.AI

A Variability-Based Framework for Interpretable Naming in Formal and Relational Concept Analysis

Alain Gutierrez , Marianne Huchard , Pierre Martin , Andr\'e Miralles , Violaine Prince This is my paper

Pith reviewed 2026-06-27 18:42 UTC · model grok-4.3

classification 💻 cs.AI
keywords formal concept analysisrelational concept analysisconcept namingllm-assisted namingvariability modelinterpretabilityknowledge extractionsymbolic data
0
0 comments X

The pith

A variability model lets users select which formal details reach an LLM when naming concepts in FCA and RCA.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops a framework for assigning readable names to concepts produced by Formal Concept Analysis and Relational Concept Analysis. A variability model decides exactly which pieces of formal information, such as intent, extent, implications, and relational attributes, are shown to the language model. This control makes the semantic decisions behind each suggested name visible and adjustable. A sympathetic reader would care because the resulting names become easier for domain experts to interpret, navigate, and validate against the original symbolic data. The method is illustrated on a small relational dataset in the pizzeria domain, where different configurations produce visibly different naming outcomes.

Core claim

The paper claims that a configurable variability model, by controlling exposure of sources such as intent, extent, inherited information, neighboring concepts, implications, and relational attributes to an LLM, makes the semantic choices involved in moving from formal concept descriptions to human-readable names explicit rather than hidden.

What carries the argument

The variability model that selects which sources of information are exposed during LLM-assisted naming.

If this is right

  • Different configurations of the variability model produce different names suggested by the LLM.
  • Naming variability reveals interpretation choices made when assigning names.
  • The approach highlights relational dependencies present in the underlying data.
  • Possible modeling issues in the symbolic data become detectable through inconsistent or surprising names.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same variability control could be applied to naming tasks in other symbolic knowledge structures beyond FCA and RCA.
  • Domain experts could iterate on names by successively adding or removing formal sources until the output satisfies both formal fidelity and domain fit.
  • The framework might support automated checks that flag when an LLM name violates a formal implication included in the exposure.

Load-bearing premise

That exposing different combinations of formal elements to an LLM produces names faithful to the formal structure and useful to domain experts without introducing inconsistencies the variability model cannot detect.

What would settle it

Run the same concept through two configurations that differ only in whether implications are exposed and check whether the generated names remain consistent with the formal implications or produce contradictions.

read the original abstract

Knowledge extraction from symbolic data often produces abstractions that are formally defined but not immediately interpretable by users. Formal Concept Analysis (FCA) and Relational Concept Analysis (RCA) provide representative settings for this issue: they generate explicit conceptual structures, implications, and relational dependencies from object descriptions and relations. Although these structures are explainable by design, their concepts are often identified by technical labels, which limits their use as human-interpretable knowledge units. Assigning meaningful names to such concepts is therefore a key issue for interpretation, navigation, validation, and reuse by domain experts. This paper investigates concept naming in FCA and RCA from a symbolic knowledge representation perspective. We first characterize the linguistic and terminological challenges involved in naming generated symbolic abstractions, including ambiguity, discrimination, concision, and consistency across related concepts. We then propose a configurable framework for LLM-assisted concept naming. The framework relies on a variability model that controls which sources of information are exposed during naming, such as intent, extent, inherited information, neighboring concepts, implications, and relational attributes. It thereby makes explicit the semantic choices involved in moving from formal concept descriptions to human-readable names. The approach is illustrated as a proof of concept on a small relational dataset in the pizzeria domain. This illustration shows how different configurations influence the names suggested by an LLM, and how naming variability can reveal interpretation choices, relational dependencies, and possible modeling issues in the underlying symbolic data.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 0 minor

Summary. The paper claims that a configurable LLM-assisted framework for naming concepts in Formal Concept Analysis (FCA) and Relational Concept Analysis (RCA) can make the semantic choices involved in moving from formal structures to human-readable names explicit. The framework uses a variability model to control exposure of elements such as intent, extent, inherited information, neighboring concepts, implications, and relational attributes. This is presented as addressing linguistic challenges like ambiguity and consistency, and is illustrated as a proof-of-concept on a small relational pizzeria dataset showing how different configurations affect LLM-suggested names.

Significance. If the central assumption holds, the work could improve usability of FCA/RCA outputs for domain experts by providing a transparent, configurable bridge between symbolic abstractions and natural language names. The explicit variability model is a conceptual strength for revealing modeling choices. However, the current illustration on a single small dataset without quantitative evaluation or faithfulness checks limits the assessed significance to a preliminary demonstration rather than a validated method.

major comments (2)
  1. [Abstract] Abstract (final paragraph) and the proof-of-concept illustration: The central claim that the variability model makes semantic choices explicit and controls the semantics of names rests on the untested assumption that LLM outputs remain faithful to the supplied formal elements. No mechanism, metric, or protocol is described to verify consistency with the input (e.g., detecting introduced attributes or relations absent from intent/extent/implications) or to flag hallucinations.
  2. [Proof-of-concept illustration] The manuscript provides only qualitative demonstration on a small pizzeria dataset with no quantitative evaluation, error analysis, baseline comparisons, or expert validation protocol. This leaves the generalizability of the framework and the influence of different variability configurations unassessed, undermining the claim that the approach reliably reveals interpretation choices or modeling issues.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive comments, which correctly note the preliminary character of the illustration. We address each major comment below, agreeing that additional discussion of limitations is warranted while defending the framework's core contribution as the explicit variability model.

read point-by-point responses

  1. Referee: [Abstract] Abstract (final paragraph) and the proof-of-concept illustration: The central claim that the variability model makes semantic choices explicit and controls the semantics of names rests on the untested assumption that LLM outputs remain faithful to the supplied formal elements. No mechanism, metric, or protocol is described to verify consistency with the input (e.g., detecting introduced attributes or relations absent from intent/extent/implications) or to flag hallucinations.

    Authors: We agree that the manuscript does not describe any mechanism, metric, or protocol for verifying that LLM outputs remain faithful to the supplied formal elements or for detecting hallucinations. The variability model is intended to make the configuration choices explicit to the user, thereby surfacing the semantic decisions involved in naming; however, this does not guarantee that the LLM will respect those inputs. In revision we will add a new subsection on faithfulness considerations, including a suggested manual verification protocol (e.g., checking that every attribute or relation mentioned in a name appears in the supplied intent, extent, or implications). We will also moderate the abstract wording to present the framework as a configurable tool for exploring naming choices rather than as a system that automatically controls name semantics. revision: yes

  2. Referee: [Proof-of-concept illustration] The manuscript provides only qualitative demonstration on a small pizzeria dataset with no quantitative evaluation, error analysis, baseline comparisons, or expert validation protocol. This leaves the generalizability of the framework and the influence of different variability configurations unassessed, undermining the claim that the approach reliably reveals interpretation choices or modeling issues.

    Authors: The illustration is explicitly labeled a proof-of-concept whose purpose is to show how varying the exposed information sources produces different naming outcomes on a small, fully inspectable dataset. We accept that the absence of quantitative metrics, error analysis, baselines, or expert validation limits stronger claims about generalizability or reliability. In the revised version we will expand the limitations and future-work sections to acknowledge these gaps and to outline possible quantitative protocols (e.g., inter-rater agreement with domain experts, hallucination rate under different configurations). We will not add a full quantitative study in this revision, as that would require a substantially larger experimental design beyond the current scope. revision: partial

Circularity Check

0 steps flagged

No circularity: framework is a configurable process without self-referential derivation or fitted predictions

full rationale

The paper proposes a variability model as a configurable framework for LLM-assisted naming in FCA/RCA, illustrated qualitatively on a small pizzeria dataset. No equations, parameters, or closed-form results are derived; the central claim is that exposing different formal elements (intent, extent, implications, etc.) makes semantic choices explicit. This is presented as a process description rather than a mathematical derivation that reduces to its inputs by construction. No self-citations serve as load-bearing uniqueness theorems, no fitted inputs are relabeled as predictions, and no ansatz or renaming of known results occurs. The manuscript is self-contained as a proof-of-concept proposal with no internal reduction that would trigger the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review; no explicit free parameters, axioms, or invented entities are stated. The framework implicitly assumes LLMs can be steered reliably by selective information exposure.

pith-pipeline@v0.9.1-grok · 5798 in / 1119 out tokens · 14791 ms · 2026-06-27T18:42:51.030560+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

75 extracted references · 19 canonical work pages

  1. [1]

    In: Gandon, F., Sabou, M., Sack, H., d’Amato, C., Cudr´ e- Mauroux, P., Zimmermann, A

    Ramnandan, S.K., Mittal, A., Knoblock, C.A., Szekely, P.A.: Assigning semantic labels to data sources. In: Gandon, F., Sabou, M., Sack, H., d’Amato, C., Cudr´ e- Mauroux, P., Zimmermann, A. (eds.) The Semantic Web. Latest Advances and New Domains - 12th European Semantic Web Conference, ESWC 2015, Portoroz, Slovenia, May 31 - June 4, 2015. Proceedings. Le...

    work page doi:10.1007/978-3-319-18818-8 2015

  2. [2]

    Journal of Web Semantics76, 100761 (2023) https://doi.org/10

    Liu, J., Chabot, Y., Troncy, R., Huynh, V.-P., Labb´ e, T., Monnin, P.: From tabular data to knowledge graphs: A survey of semantic table interpretation tasks and methods. Journal of Web Semantics76, 100761 (2023) https://doi.org/10. 1016/j.websem.2022.100761

    arXiv 2023

  3. [3]

    Springer, Berlin, Heidelberg (1999)

    Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin, Heidelberg (1999)

    1999

  4. [4]

    Rouane-Hac` ene, M.R., Huchard, M., Napoli, A., Valtchev, P.: Relational concept analysis: mining concept lattices from multi-relational data. Ann. Math. Artif. Intell.67(1), 81–108 (2013)

    2013

  5. [5]

    Springer, New York, NY (2009)

    Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd edn. Springer, New York, NY (2009)

    2009

  6. [6]

    Deep learning.Nature, 521(7553):436– 444, 2015

    LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature521(7553), 436–444 (2015) https://doi.org/10.1038/nature14539

    work page doi:10.1038/nature14539 2015

  7. [7]

    In: Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications, Moscow, Russia, July 18-22, 2016

    Alam, M., Le, T.N.N., Napoli, A.: Latviz: A new practical tool for performing interactive exploration over concept lattices. In: Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications, Moscow, Russia, July 18-22, 2016. CEUR Workshop Proceedings, vol. 1624, pp. 9–20. CEUR-WS.org, Moscow, Russia (2016).https://ceur...

    2016

  8. [8]

    In: Cordero, P., Kr´ ıdlo, O

    Gutierrez, A., Huchard, M., Martin, P.: FCA4J: A java library for relational concept analysis and formal concept analysis. In: Cordero, P., Kr´ ıdlo, O. (eds.) Proceedings of the Sixteenth International Conference on Concept Lat- tices and Their Applications (CLA 2022) Tallinn, Estonia, June 20-22, 2022., Tallinn, Estonia, June 20-22, 2022. CEUR Workshop ...

    2022

  9. [9]

    In: Cristea, D., Le Ber, F., Missaoui, R., Kwuida, L., Sertkaya, B

    Hanika, T., Hirth, J.: Conexp-Clj - A Research Tool for FCA. In: Cristea, D., Le Ber, F., Missaoui, R., Kwuida, L., Sertkaya, B. (eds.) CEUR Workshop Pro- ceedings. Supplementary Proceedings of ICFCA 2019 Conference and Workshops, Frankfurt, Germany, June 25-28, 2019, pp. 70–75. CEUR-WS.org, Frankfurt, Germany (2019).http://ceur-ws.org/Vol-2378/shortAT8.pdf

    2019

  10. [10]

    Aranda-Corral, G.A., Bundy, A., Borrego-D´ ıaz, J., Chan, P.Y.: Grounding prob- lem in Formal Concept Analysis by means of Large Language Models. Ws. Late Breaking Advances on Conceptual Structures @ Concepts 2024 (2024). https://concepts2024.uca.es/lbacs/

    2024

  11. [11]

    In: 2nd Int

    Guenoune, H., Gutierrez, A., Huchard, M., Lafourcade, M., Martin, P., Miralles, A., Zhang, H.: Llm-assisted relational concept analysis for class model restruc- turing. In: 2nd Int. Joint Conf., CONCEPTS. LNCS, vol. 15941, pp. 107–123. Springer, Cluj-Napoca, Romania (2025)

    2025

  12. [12]

    In: Nebel, B

    Stumme, G., Maedche, A.: FCA-MERGE: bottom-up merging of ontologies. In: Nebel, B. (ed.) 17th Int. Joint Conf. on Artificial Intelligence (IJCAI), pp. 225–

  13. [13]

    Morgan Kaufmann, Seattle, Washington, USA (2001)

    2001

  14. [14]

    In: 11th Int

    Ganter, B., Stumme, G.: Creation and merging of ontology top-levels. In: 11th Int. Conf. on Conceptual Structures, (ICCS). LNCS, vol. 2746, pp. 131–145. Springer, Dresden, Germany (2003)

    2003

  15. [15]

    In: Proc

    Bendaoud, R., Napoli, A., Toussaint, Y.: Formal concept analysis: A unified framework for building and refining ontologies. In: Proc. of 16th Int. Conf. Knowl- edge Engineering: Practice and Patterns (EKAW). LNCS, vol. 5268, pp. 156–171. Springer, Acitrezza, Italy (2008)

    2008

  16. [16]

    In: Conceptual Structures for Discovering Knowledge

    Rouane Hacene, M., Valtchev, P., Nkambou, R.: Supporting ontology design through large-scale fca-based ontology restructuring. In: Conceptual Structures for Discovering Knowledge. Lecture Notes in Computer Science, vol. 6828, pp. 257–269. Springer, Berlin, Heidelberg (2011)

    2011

  17. [17]

    In: 23rd Int

    Monnin, P., Lezoche, M., Napoli, A., Coulet, A.: Using formal concept analysis for checking the structure of an ontology in LOD: the example of dbpedia. In: 23rd Int. Symp. Foundations of Intelligent Systems, (ISMIS). Lecture Notes in Computer Science, vol. 10352, pp. 674–683. Springer, Cham (2017)

    2017

  18. [18]

    Lecture Notes in Computer Science, vol

    Eklund, P.W., Ducrou, J., Brawn, P.: Concept lattices for information visualiza- tion: Can novices read line-diagrams? In: Formal Concept Analysis. Lecture Notes in Computer Science, vol. 2961, pp. 57–73. Springer, Berlin, Heidelberg (2004)

    2004

  19. [19]

    Wiley, Chichester (2005)

    Carpineto, C., Romano, G.: Concept Data Analysis - Theory and Appl. Wiley, Chichester (2005)

    2005

  20. [20]

    In: Proceedings 44 of the Joint Workshop on Euler Diagrams and Graph Visualization in Practice

    Pattison, T.: Interactive visualization of formal concept lattices. In: Proceedings 44 of the Joint Workshop on Euler Diagrams and Graph Visualization in Practice. CEUR Workshop Proceedings, vol. 1244, pp. 78–89. CEUR-WS.org, Melbourne, Australia (2014)

    2014

  21. [21]

    In: Proceedings of the 4th International Conference on Web Intelligence, Mining and Semantics

    Crampes, M., Planti´ e, M.: Visualizing and interacting with concept hierarchies. In: Proceedings of the 4th International Conference on Web Intelligence, Mining and Semantics. ACM, Thessaloniki, Greece (2014)

    2014

  22. [22]

    In: CSTIW@ICCS

    Andrews, S., Hirsch, L.: A tool for creating and visualising formal concept trees. In: CSTIW@ICCS. CEUR Works. Proceedings, vol. 1637, pp. 1–9 (2016)

    2016

  23. [23]

    In: CLA’16, pp

    Alam, M., Le, T.N.N., Napoli, A.: Latviz: A new practical tool for performing interactive exploration over concept lattices. In: CLA’16, pp. 9–20 (2016)

    2016

  24. [24]

    Information and Software Technology87

    Greene, G.J., Esterhuizen, M., Fischer, B.: Visualizing and exploring software ver- sion control repositories using interactive tag clouds over formal concept lattices. Information and Software Technology87

  25. [25]

    PhD thesis, Stellenbosch University

    Greene, G.J.: Concept-Based Exploration of Rich Semi-Structured Data Collec- tions. PhD thesis, Stellenbosch University

  26. [26]

    Huchard, M., Martin, P., Muller, E., Poncelet, P., Raveneau, V., Sallaberry, A.: RCAviz: Exploratory search in multi-relational datasets represented using relational concept analysis. Int. J. Approx. Reason.166, 109123 (2024)

    2024

  27. [27]

    Machine Learning24(2), 95–122 (1996)

    Carpineto, C., Romano, G.: A lattice conceptual clustering system and its application to browsing retrieval. Machine Learning24(2), 95–122 (1996)

    1996

  28. [28]

    Priss, U.: Lattice-based information retrieval. Knowl. Organ.27(3), 132–142 (2000)

    2000

  29. [29]

    In: 2nd Int

    Cigarr´ an, J.M., Gonzalo, J., Pe˜ nas, A., Verdejo, F.: Browsing search results via formal concept analysis: Automatic selection of attributes. In: 2nd Int. Conf. on Formal Concept Analysis (ICFCA). LNCS, vol. 2961, pp. 74–87. Springer, Berlin, Heidelberg (2004)

    2004

  30. [30]

    JUCS - Journal of Universal Computer Science 10(8), 985–1013 (2004)

    Carpineto, C., Romano, G.: Exploiting the potential of concept lattices for in- formation retrieval with credo. JUCS - Journal of Universal Computer Science 10(8), 985–1013 (2004)

    2004

  31. [31]

    Codocedo, V., Lykourentzou, I., Napoli, A.: A semantic approach to concept lattice-based information retrieval. Ann. Math. Artif. Intell.72(1-2), 169–195 (2014)

    2014

  32. [32]

    In: The 18th IEEE International Conference on Program Comprehension, ICPC 2010, 45 Braga, Minho, Portugal, June 30-July 2, 2010, pp

    Falleri, J., Huchard, M., Lafourcade, M., Nebut, C., Prince, V., Dao, M.: Au- tomatic extraction of a wordnet-like identifier network from software. In: The 18th IEEE International Conference on Program Comprehension, ICPC 2010, 45 Braga, Minho, Portugal, June 30-July 2, 2010, pp. 4–13. IEEE Computer So- ciety, Braga, Minho, Portugal (2010). https://doi.o...

    work page doi:10.1109/icpc.2010.12 2010

  33. [33]

    In: 2nd Int

    Gutierrez, A., Huchard, M., Martin, P., Zhang, H.: Empowering relational concept analysis using large language model knowledge delivery. In: 2nd Int. Joint Conf. CONCEPTS. LNCS, vol. 15941, pp. 124–139. Springer, Cluj-Napoca, Romania (2025)

    2025

  34. [34]

    Dolques, X., Ber, F.L., Huchard, M., Grac, C.: Performance-friendly rule extrac- tion in large water data-sets with AOC posets and relational concept analysis. Int. J. Gen. Syst.45(2), 187–210 (2016)

    2016

  35. [35]

    In: Supplementary Proceedings of the 15th Interna- tional Conference on Formal Concept Analysis

    Dolques, X., Braud, A., Huchard, M., Le Ber, F.: RCAexplore, a FCA Based Tool to Explore Relational Data. In: Supplementary Proceedings of the 15th Interna- tional Conference on Formal Concept Analysis. CEUR Workshop Proceedings, vol. 2378, pp. 55–59. CEUR-WS.org, Frankfurt, Germany (2019)

    2019

  36. [36]

    In: Proc of K-CAP 2019, pp

    Wajnberg, M., Valtchev, P., Lezoche, M., Panetto, H., Mass´ e, A.B.: Mining pro- cess factor causality links with multi-relational associations. In: Proc of K-CAP 2019, pp. 263–266. ACM, Marina Del Rey, CA, USA (2019)

    2019

  37. [37]

    In: CONCEPTS 2024

    Musslin, L., Bazin, A., Huchard, M., Martin, P., Poncelet, P., Raveneau, V., Sallaberry, A.: FCAvizIR: Exploring Relational Data Set’s Implications Using Metrics and Topics. In: CONCEPTS 2024. LNCS, vol. 14914, pp. 132–148. Springer, Cham (2024)

    2024

  38. [38]

    In: Proc

    Lafourcade, M., Prince, V.: Relative synonymy and conceptual vectors. In: Proc. of the 6th Natural Language Processing Pacific Rim Symp., pp. 127–134 (2001). http://www.afnlp.org/nlprs2001/pdf/0173-01.pdf

    2001

  39. [39]

    Priss, U.: A semiotic perspective on polysemy. Ann. Math. Artif. Intell.90(11-12), 1125–1138 (2022) https://doi.org/10.1007/S10472-022-09795-1

    work page doi:10.1007/s10472-022-09795-1 2022

  40. [40]

    In: 19th Int

    Schwab, D., Lafourcade, M., Prince, V.: Antonymy and conceptual vectors. In: 19th Int. Conf. on Computational Linguistics (COLING) (2002)

    2002

  41. [41]

    In: 8th An

    Godin, R., Mili, H.: Building and maintaining analysis-level class hierarchies using galois lattices. In: 8th An. Conf. on Object-Oriented Prog. Systems, Languages, and App., (OOPSLA), pp. 394–410. ACM, Washington, DC, USA (1993)

    1993

  42. [42]

    Cellier, P., Ferr´ e, S., Ridoux, O., Ducass´ e, M.: A parameterized algorithm to explore formal contexts with a taxonomy. Int. J. Found. Comput. Sci.19(2), 319–343 (2008)

    2008

  43. [43]

    Springer, Berlin, Heidelberg (2016) 46

    Ganter, B., Obiedkov, S.A.: Conceptual Exploration. Springer, Berlin, Heidelberg (2016) 46

    2016

  44. [44]

    Psychological Review63(2), 81–97 (1956) https://doi.org/10.1037/h0043158

    Miller, G.A.: The magical number seven, plus or minus two: Some limits on our capacity for processing information. Psychological Review63(2), 81–97 (1956) https://doi.org/10.1037/h0043158

    work page doi:10.1037/h0043158 1956

  45. [45]

    Behavioral and Brain Sciences24(1), 87–185 (2001)

    Cowan, N.: The magical number 4 in short-term memory: A reconsideration of mental storage capacity. Behavioral and Brain Sciences24(1), 87–185 (2001)

    2001

  46. [46]

    Cogn Sci

    Sweller, J.: Cognitive load during problem solving: Effects on learning. Cogn Sci. 12(2), 257–285 (1988)

    1988

  47. [47]

    Springer, Berlin, Heidelberg (2005)

    Pohl, K., B¨ ockle, G., Linden, F.: Software Product Line Engineering - Foun- dations, Principles, and Techniques. Springer, Berlin, Heidelberg (2005). https: //doi.org/10.1007/3-540-28901-1 .https://doi.org/10.1007/3-540-28901-1

    work page doi:10.1007/3-540-28901-1 2005

  48. [48]

    Jour- nal of Systems and Software225, 112326 (2025) https://doi.org/10.1016/j.jss

    Benavides, D., Sundermann, C., Feichtinger, K., Galindo, J.A., Rabiser, R., Th¨ um, T.: Uvl: Feature modelling with the universal variability language. Jour- nal of Systems and Software225, 112326 (2025) https://doi.org/10.1016/j.jss. 2024.112326

    work page doi:10.1016/j.jss 2025

  49. [49]

    effec- tive prior

    Aranda-Corral, G.A., Bundy, A., Borrego-D´ ıaz, J., Chan, P.Y.: Grounding prob- lem in FCA by means of LLMs. Zenodo (2026). https://doi.org/10.5281/zenodo. 18608706

    work page doi:10.5281/zenodo 2026

  50. [50]

    Semantic Web (2026)

    Li, J., Garijo, D., Poveda, M.: Large language models for ontology engineering: A systematic literature review. Semantic Web (2026). Accepted survey article

    2026

  51. [51]

    In: Proceedings of the Special Session on Harmonising Generative AI and Semantic Web Technologies (HGAIS

    Garijo, D., Poveda-Villal´ on, M., Amador-Dominguez, E., Wang, Z., Garc´ ıa- Castro, R., Corcho, O.: Large language models for ontology engineering: A landscape of tasks and benchmarking challenges. In: Proceedings of the Special Session on Harmonising Generative AI and Semantic Web Technologies (HGAIS

  52. [52]

    Co-located with the 23rd International Semantic Web Conference (ISWC

  53. [53]

    (2024).https://ceur-ws.org/Vol-3953/364.pdf

    2024

  54. [54]

    Journal of Web Semantics85(2025) https://doi

    Shimizu, C., Hitzler, P.: Accelerating knowledge graph and ontology engineering with large language models. Journal of Web Semantics85(2025) https://doi. org/10.1016/j.websem.2025.100862 .©2025 The Authors

    work page doi:10.1016/j.websem.2025.100862 2025

  55. [55]

    In: Proceedings of the Eleventh International Conference on Infor- mation and Knowledge Management

    Glover, E., Pennock, D.M., Lawrence, S., Krovetz, R.: Inferring hierarchical descriptions. In: Proceedings of the Eleventh International Conference on Infor- mation and Knowledge Management. CIKM ’02, pp. 507–514. Association for Computing Machinery, New York, NY, USA (2002). https://doi.org/10.1145/ 584792.584876 .https://doi.org/10.1145/584792.584876

    work page doi:10.1145/584792.584876 2002

  56. [56]

    In: Proceedings of the 2006 International Conference on Digital Government Re- search

    Treeratpituk, P., Callan, J.: Automatically labeling hierarchical clusters. In: Proceedings of the 2006 International Conference on Digital Government Re- search. dg.o ’06, pp. 167–176. Digital Government Society of North Amer- ica, San Diego, CA, USA (2006). https://doi.org/10.1145/1146598.1146650 . 47 https://doi.org/10.1145/1146598.1146650

    work page doi:10.1145/1146598.1146650 2006

  57. [57]

    In: Proceedings of the 49th Annual Meeting of the Association for Com- putational Linguistics: Human Language Technologies - Volume 1

    Lau, J.H., Grieser, K., Newman, D., Baldwin, T.: Automatic labelling of topic models. In: Proceedings of the 49th Annual Meeting of the Association for Com- putational Linguistics: Human Language Technologies - Volume 1. HLT ’11, pp. 1536–1545. Association for Computational Linguistics, USA (2011)

    2011

  58. [58]

    In: Ganter, B., Stumme, G., Wille, R

    Priss, U.: Linguistic applications of formal concept analysis. In: Ganter, B., Stumme, G., Wille, R. (eds.) Formal Concept Analysis, Foundations and Appli- cations. Lecture Notes in Computer Science, vol. 3626, pp. 149–160. Springer, Berlin, Heidelberg (2005)

    2005

  59. [59]

    PhD thesis, Darmstadt University of Technology, Germany (1998)

    Priss, U.: Relational concept analysis: semantic structures in dictionaries and lexi- cal databases. PhD thesis, Darmstadt University of Technology, Germany (1998). https://d-nb.info/955153514

    arXiv 1998

  60. [60]

    In: 2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), pp

    Zheng, F., Cui, L.: A lexical-based formal concept analysis method to identify missing concepts in the nci thesaurus. In: 2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), pp. 1757–1760 (2020). https://doi.org/ 10.1109/BIBM49941.2020.9313186

    work page doi:10.1109/bibm49941.2020.9313186 2020

  61. [61]

    In: Ferr´ e, S., Rudolph, S

    Priss, U., Old, L.J.: Revisiting the potentialities of a mechanical thesaurus. In: Ferr´ e, S., Rudolph, S. (eds.) Formal Concept Analysis, 7th International Conference, ICFCA 2009, Darmstadt, Germany, May 21-24, 2009, Proceed- ings. Lecture Notes in Computer Science, vol. 5548, pp. 284–298. Springer, Darmstadt, Germany (2009). https://doi.org/10.1007/978...

    work page doi:10.1007/978-3-642-01815-2 2009

  62. [62]

    In: Priss, U., Polovina, S., Hill, R

    Priss, U., Old, L.J.: Bilingual word association networks. In: Priss, U., Polovina, S., Hill, R. (eds.) Conceptual Structures: Knowledge Architectures for Smart Ap- plications, 15th International Conference on Conceptual Structures, ICCS 2007, Sheffield, UK, July 22-27, 2007, Proceedings. Lecture Notes in Computer Science, vol. 4604, pp. 310–320. Springer...

    work page doi:10.1007/978-3-540-73681-3 2007

  63. [63]

    In: Wolff, K.E., Palchunov, D.E., Zagoruiko, N.G., Andelfinger, U

    Priss, U., Old, L.J.: Data weeding techniques applied to roget’s thesaurus. In: Wolff, K.E., Palchunov, D.E., Zagoruiko, N.G., Andelfinger, U. (eds.) Knowl- edge Processing and Data Analysis - First International Conference, KONT 2007, Novosibirsk, Russia, September 14-16, 2007 and First International Con- ference, KPP 2007,Darmstadt, Germany, September 2...

    work page doi:10.1007/978-3-642-22140-8 2007

  64. [64]

    Expert Systems with Applications41(11), 48 5495–5508 (2014) https://doi.org/10.1016/j.eswa.2014.02.036

    Cigarr´ an-Recuero, J., Gayoso-Cabada, J., Rodr´ ıguez-Artacho, M., Romero- L´ opez, M.-D., Sarasa-Cabezuelo, A., Sierra, J.-L.: Assessing semantic annotation activities with formal concept analysis. Expert Systems with Applications41(11), 48 5495–5508 (2014) https://doi.org/10.1016/j.eswa.2014.02.036

    work page doi:10.1016/j.eswa.2014.02.036 2014

  65. [65]

    In: Formal Concept Analysis of Social Networks

    Missaoui, R., Kuznetsov, S.O., Obiedkov, S.: Acquisition of terminological knowl- edge from social networks. In: Formal Concept Analysis of Social Networks. Lecture Notes in Social Networks, p. . Springer, Cham (2017). https://doi.org/ 10.1007/978-3-319-64167-6

    work page doi:10.1007/978-3-319-64167-6 2017

  66. [66]

    Journal of Universal Computer Science10(8), 967–984 (2004)

    Priss, U., Old, L.J.: Modelling lexical databases with formal concept analysis. Journal of Universal Computer Science10(8), 967–984 (2004)

    2004

  67. [67]

    In: FCAIR Workshop: Formal Concept Analysis Meets Information Retrieval

    Ignatov, D.I., Kuznetsov, S.O.: Formal concept analysis for information re- trieval and text mining. In: FCAIR Workshop: Formal Concept Analysis Meets Information Retrieval. CEUR Workshop Proceedings, Moscow, Russia (2013)

    2013

  68. [68]

    Computing and Informatics40(3), 469–488 (2021) https://doi.org/10

    Formica, A.: Concept similarity in formal concept analysis with many-valued contexts. Computing and Informatics40(3), 469–488 (2021) https://doi.org/10. 31577/cai 2021 3 469

    2021

  69. [69]

    arXiv preprint (2023) 2304.08093

    Hirth, J., Horn, V., Stumme, G., Hanika, T.: Automatic textual explanations of concept lattices. arXiv preprint (2023) 2304.08093

    arXiv 2023

  70. [70]

    Maio, C.D., Fenza, G., Gallo, M., Loia, V., Senatore, S.: Formal and relational concept analysis for fuzzy-based automatic semantic annotation. Appl. Intell. 40(1), 154–177 (2014) https://doi.org/10.1007/S10489-013-0451-7

    work page doi:10.1007/s10489-013-0451-7 2014

  71. [71]

    In: Proc

    Liu, Z., Chen, C., Wang, J., Chen, M., Wu, B., Che, X., Wang, D., Wang, Q.: Make LLM a Testing Expert: Bringing Human-like Interaction to Mobile GUI Testing via Functionality-aware Decisions. In: Proc. of 46th ICSE. ACM, Lisbon, Portugal (2024)

    2024

  72. [72]

    Agricultural Systems122, 11–21 (2013)

    Vernier, F., Miralles, A., Pinet, F., Carluer, N., Gouy, V., Molla, G., Petit, K.: EIS Pesticides: An environmental information system to characterize agricultural activities and calculate agro-environmental indicators at embedded watershed scales. Agricultural Systems122, 11–21 (2013)

    2013

  73. [73]

    Plants10, 896 (2021)

    Silvie, P., Martin, P., Huchard, M., Keip, P., Gutierrez, A., Sarter, S.: Prototyping a knowledge-based system to identify botanical extracts for plant health in sub- saharan africa. Plants10, 896 (2021)

    2021

  74. [74]

    In: Chapman, P., Endres, D.M., Per- nelle, N

    Nica, C., Braud, A., Ber, F.L.: Exploring heterogeneous sequential data on river networks with relational concept analysis. In: Chapman, P., Endres, D.M., Per- nelle, N. (eds.) Graph-Based Representation and Reasoning - 23rd International Conference on Conceptual Structures, ICCS 2018, Edinburgh, UK, June 20-22, 2018, Proceedings. Lecture Notes in Compute...

    work page doi:10.1007/978-3-319-91379-7 2018

  75. [75]

    In: Braud, A., Dolques, X., Missaoui, R

    Braud, A., Dolques, X., Fechter, P., Lachiche, N., Ber, F.L., Pitchon, V.: An- alyzing the composition of remedies in ancient pharmacopeiae with FCA. In: Braud, A., Dolques, X., Missaoui, R. (eds.) Proceedings of the Workshop Analyz- ing Real Data with Formal Concept Analysis Co-located with 16th International Conference on Formal Concept Analysis (ICFCA ...

    2021