Negation in Contextual Logic. - Léonard Kwuida; Andreja Tepavcevic; Branimir Seselja (ICCS, 2004)

When Is a Concept Algebra Boolean? - Léonard Kwuida (ICFCA, 2004)

Which Concept Lattices Are Pseudocomplemented?. - Bernhard Ganter; Léonard Kwuida (ICFCA, 2005)

A Note on Negation: A PCS-Completion of Semilattices. - Léonard Kwuida (ICFCA, 2006)

Finite Distributive Concept Algebras. - Bernhard Ganter; Léonard Kwuida (Order, 2006)

On the MacNeille Completion of Weakly Dicomplemented Lattices. - Léonard Kwuida; Branimir Seselja; Andreja Tepavcevic (ICFCA, 2007)

What Can Formal Concept Analysis Do for Data Warehouses?. - Rokia Missaoui; Léonard Kwuida (ICFCA, 2009)

Algebraic operators for querying pattern bases - Rokia Missaoui; Léonard Kwuida; Mohamed Quafafou; Jean Vaillancourt (CoRR, 2009)

Mining Generalized Patterns from Large Databases using Ontologies - Léonard Kwuida; Rokia Missaoui; Lahcen Boumedjout; Jean Vaillancourt (CoRR, 2009)

Restrictions on Concept Lattices for Pattern Management. - Léonard Kwuida; Rokia Missaoui; Beligh Ben Amor; Lahcen Boumedjout; Jean Vaillancourt (CLA, 2010)

On the isomorphism problem of concept algebras. - Léonard Kwuida; Hajime Machida (Ann. Math. Artif. Intell., 2010)

Mining Triadic Association Rules from Ternary Relations. - Rokia Missaoui; Léonard Kwuida (ICFCA, 2011)

Valuations and closure operators on finite lattices. - Léonard Kwuida; Stefan E. Schmidt (Discret. Appl. Math., 2011)

On the Homomorphism Order of Labeled Posets. - Léonard Kwuida; Erkko Lehtonen (Order, 2011)

Using Taxonomies on Objects and Attributes to Discover Generalized Patterns. - Léonard Kwuida; Rokia Missaoui; Jean Vaillancourt (CLA, 2012)

Generalized pattern extraction from concept lattices. - Léonard Kwuida; Rokia Missaoui; Abdélilah Balamane; Jean Vaillancourt (Ann. Math. Artif. Intell., 2014)

Descriptive group detection in two-mode data networks using biclustering. - Abdélilah Balamane; Rokia Missaoui; Léonard Kwuida; Jean Vaillancourt (ASONAM, 2016)

A Discrete Representation for Dicomplemented Lattices. - Ivo Düntsch; Léonard Kwuida; Ewa Orlowska (Fundam. Informaticae, 2017)

A Similarity Measure to Generalize Attributes. - Rostand S. Kuitché; Romuald E. A. Temgoua; Léonard Kwuida (CLA, 2018)

Découverte de biclusters avec présence ou absence de propriétés. - Abdélilah Balamane; Rokia Missaoui; Léonard Kwuida; Jean Vaillancourt (EDA, 2018)

A single axiom for Boolean algebras. - Léonard Kwuida (Discret. Appl. Math., 2018)

On Interpretability and Similarity in Concept-Based Machine Learning. - Léonard Kwuida; Dmitry I. Ignatov (AIST, 2020)

Shapley and Banzhaf Vectors of a Formal Concept. - Dmitry I. Ignatov; Léonard Kwuida (CLA, 2020)

Interpretable Concept-Based Classification with Shapley Values. - Dmitry I. Ignatov; Léonard Kwuida (ICCS, 2020)

Pattern Discovery in Triadic Contexts. - Rokia Missaoui; Pedro H. B. Ruas; Léonard Kwuida; Mark A. J. Song (ICCS, 2020)

On the size of ∃-generalized concept lattices. - Léonard Kwuida; Rostand S. Kuitché; Romuald E. A. Temgoua (Discret. Appl. Math., 2020)

Functorial Properties of the Reticulation of a Universal Algebra. - George Georgescu; Léonard Kwuida; Claudia Muresan (FLAP, 2020)

Filters, Ideals and Congruences on Double Boolean Algebras. - Tenkeu Jeufack Yannick Léa; Etienne Romuald Alomo Temgoua; Léonard Kwuida (ICFCA, 2021)

Mining the Groceries Database using Triadic Concept Analysis. - Pedro H. B. Ruas; Rokia Missaoui; Mark A. J. Song; Léonard Kwuida (RealDataFCA@ICFCA, 2021)

Formal Concept Analysis and Extensions for Complex Data Analytics. - Léonard Kwuida; Rokia Missaoui (Complex Data Analytics with Formal Concept Analysis, 2022)

On Shapley value interpretability in concept-based learning with formal concept analysis. - Dmitry I. Ignatov; Léonard Kwuida (Ann. Math. Artif. Intell., 2022)

Computing triadic generators and association rules from triadic contexts. - Rokia Missaoui; Pedro H. B. Ruas; Léonard Kwuida; Mark A. J. Song; Mohamed Hamza Ibrahim (Ann. Math. Artif. Intell., 2022)

Formal Concepts and Residuation on Multilattices. - Blaise Blériot Koguep Njionou; Léonard Kwuida; Célestin Lélé (Fundam. Informaticae, 2022)

Rough Fuzzy Concept Analysis via Multilattice. - Gaël Nguepy Dongmo; Blaise Blériot Koguep Njionou; Léonard Kwuida; Mathias Onabid (IJCRS, 2023)

On Nontrivial Weak Dicomplementations and the Lattice Congruences that Preserve Them. - Léonard Kwuida; Claudia Muresan (Order, 2023)

An Optimal Set of Implications in Triadic Contexts. - Romuald Kwessy Mouona; Blaise Blériot Koguep Njionou; Léonard Kwuida; Etienne Romuald Temgoua Alomo (AIST, 2024)

Shapley Values in Classification Problems with Triadic Formal Concept Analysis. - Martin Waffo Kemgne; Blaise Blériot Koguep Njionou; Léonard Kwuida; Dmitry I. Ignatov (CONCEPTS, 2024)

Subdirectly Irreducible and Semisimple Double Boolean Algebras. - Léonard Kwuida; Etienne Romuald Temgoua Alomo (CONCEPTS, 2024)

Triadic data: Representation and reduction. - Léa Aubin Kouankam Djouohou; Blaise Blériot Koguep Njionou; Léonard Kwuida (Int. J. Approx. Reason., 2025)

Double Boolean algebras: Constructions, sub-structures and morphisms. - Gael Tenkeu Kembang; Tenkeu Jeufack Yannick Léa; Etienne Romuald Temgoua Alomo; Léonard Kwuida (Int. J. Approx. Reason., 2025)

Cooperative games with fuzzy characteristic functions on concept lattices. - Martin Waffo Kemgne; Blaise Blériot Koguep Njionou; Dmitry I. Ignatov; Léonard Kwuida (Int. J. Approx. Reason., 2025)

Multilattice as the set of truth values for fuzzy rough sets. - Gaël Nguepy Dongmo; Blaise Blériot Koguep Njionou; Léonard Kwuida; Mathias Akong Onabid (J. Appl. Non Class. Logics, 2025)