Accepted Papers

Journal track

TBA

Long papers
  • O. Bruneau, P. D. Treuil, J. Lieber, E. Nauer and L. Rollet, Exploring cultural heritage corpus using formal concept analysis
  • V. Pavlikova and M. Trnecka, Visual Exploration of Boolean Factors
  • P. Krajča and M. Trnecka, GreCon2Compact: Memory-Efficient Evolution of the GreCon Algorithm for Boolean Matrix Factorization
  • K. M. Gutekunst, D. Dürrschnabel, S. Schneider and M. Potthast, Hierarchical Background Knowledge in FCA via Must-Link-Before Constraints
  • F. Adam and T. Hille, Revisiting Attribute Ordering for Concept Mining
  • M. Abdulla, D. Dürrschnabel and L. Kwuida, The Boolean Envelope of Finite Distributive Lattices
  • V. Pavlikova, M. Trnecka, J. Guniš, L. Šnajder, D. Kotlárová, S. Krajči, L. Antoni and P. Eliaš, Conceptual Patterns in Teachers’ AI Perception
  • M. Abdulla, J. Nordmeyer and T. Hanika, Degrees of Distributivity: Quantifying Structural Deviations in Real World Data
  • N. Lefrancois and J. Reynaud, On Exhaustive Enumeration of Redescriptions
  • A. Meunier, L. Nourine and S. Vilmin, Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
  • E. Reyner-Fuentes, C. Peláez-Moreno and F. J. Valverde-Albacete, On the Limits of Information Transmission in Concept Lattices
  • C. Demko and K. Bertet, Minimal Sublattice Extensions of Moore Families
  • K. M. Romuald, K. Léonard, K. N. B. Blériot, T. A. E. Romuald and M. Rokia, Updating a Base of Triadic Implications when Attributes are Added or Removed
  • T. Pattison, D. Durrschnabel and M. Abdullah, Using JRL Order to Shape Spanning Trees for Interactive FCA
  • J. Baixeries, A. Bazin, J. David and A. Napoli, Themes and Variations in Integrating Clustering in FCA
  • S. Obiedkov and B. Sertkaya, Lattice-Based Approaches for Computing Stable Extensions in Abstract Argumentation Frameworks
  • G. T. Kembang, C. Nganteu, L. Kwuida and E. R. T. Alomo, Co-reflexivity in the category of double Boolean algebras
Short papers
  • U. Priss, Alternative Visualisations for Concept Lattices
  • H. Ladj, M. Croitoru and N. Blanc, Using Storytelling for Knowledge Acquisition in Child–Robot Interaction
  • M. Saleem, S. Polovina and R. Fallon, Advancing Metadata-Driven Enterprise Architecture Management Tools Using Conceptual Structures
  • A. Bazin, n-Dimensional Hypercontexts
  • J. Hirth and T. Hanika, Conceptual Scaling of Neural Networks: A Formal Framework for Global Explainability
  • S. A. Benabderrahmane, S. Chaudhry and T. Rahwan, Real Talk, Virtual Faces: A Formal Concept Analysis of Personality and Sentiment in Influencer Audiences
  • M. Saleem, S. Polovina and R. Fallon, Exploring Enterprise Architecture Metadata by applying Conceptual Graphs — Formal Concept Analysis (CGFCA) to Moregraph
Supplementary proceedings
  • U. Priss, Lattice Spaces and Formal Concept Analysis
  • S. C. M. Shing, R. Gowrishankar, E. Brigaud, N. Blanc, M. Croitoru and G. Ganesh, Conceptual Modelling of Multimodal Human–Robot Interaction with Touch
  • T. Hille and L. Noori, adaptexts: A Framework for Adapters of Formal Contexts
  • E. Dudyrev, C. Demko, M. Couceiro, M. Kaytoue, K. Bertet, A. Napoli and S. O. Kuznetsov, The Multiple Facets of Pattern Structures
  • I. Ben Sassi, A. Bazin, H. Guenoune, M. Huchard, M. Lafourcade and J. Sallantin, Argo: Argumentation Reasoning with Relational Concept Analysis for Online Debates Exploration
  • S. Schneider, R. Tidke, S. Verheyen, A. Schulz and A. Nürnberger, Detecting intra-categorical structure through contextual bundling on relevant attributes
  • Y. Ghodbane, F. Lecourt, Y. Gabay, K. Todorov, G. Ganesh and M. Croitoru, Blame Assignment in Hybrid Human-AI Teams
Nectar track
  • B. Sinclair-Desgagné, Chasing Unknown Unknowns with the Available Data
  • M. Espinosa-Aldama and S. Mendoza, Multidimensional Representation of Physical Theories, Constants and Units Using Formal Concept Analysis
  • F. Valverde, C. Peláez-Moreno, I. P. Cabrera, P. Cordero and M. Ojeda-Aciego, Formal Context Transforms and Their Affordances for Exploratory Data Analysis
  • G. Stumme, D. Dürrschnabel and T. Hanika, Towards Ordinal Data Science
  • A. Bazin and G. Kahn, Distance between FCA structures
  • F. Hodo, S. Balderas-Díaz, G. Guerrero-Contreras and B. Sertkaya, Interactive Exploration of Concept Lattices with lattice.js: A Web-Based Visualization Library
  • K. Adaricheva, L. Nourine and S. Vilmin, Computing the D-base and D-relation in finite closure systems
  • O. Defrain, A. Ohana and S. Vilmin, Enumerating the irreducible closed sets of an acyclic implicational base of bounded degree
  • J. Medina, R. G. Aragón and S. Molina-Ruiz, Computing Bonds Between Formal Contexts
  • M. E. C. Piñero, J. Medina and F. J. Ocaña, Attribute implication bases from Galois connection structures