Célestin Lélé

dblp:13/1552 · DBLP profile ↗
← Back
13ranked-venue papers
4as first author
5since 2021 · last 2023
0000-0002-0784-1377ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 12 · 4 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1Theory of computation · 1 · 1 since 2021
YearPublicationVenuePosition
2023 Quasihyperarchimedean BL-algebras
Célestin Lélé, Jean B. Nganou, Christian Maxime Steve Oumarou
Fuzzy Sets Syst.1
2022 Ideals of semisimple MV-algebras and convergence along set-theoretic filters
Célestin Lélé, Jean B. Nganou, Christian Maxime Steve Oumarou
Fuzzy Sets Syst.1
2022 Formal Concepts and Residuation on Multilattices
abstract
Multilattices are generalisations of lattices introduced by Mihail Benado. He replaced the existence of unique lower (resp. upper) bound by the existence of maximal lower (resp. minimal upper) bound(s). A multilattice will be called pure if it is not a lattice. Multilattices could be endowed with a residuation, and therefore used as set of truth-values to evaluate elements in fuzzy setting. In this paper we exhibit the smallest pure multilattice and show that it is a sub-multilattice of any pure multilattice. We also prove that any bounded residuated multilattice that is not a residuated lattice has at least seven elements. We apply the ordinal sum construction to get more examples of residuated multilattices that are not residuated lattices. We then use these residuated multilattices to evaluate objects and attributes in formal concept analysis setting, and describe the structure of the set of corresponding formal concepts. More precisely, if $\mathcal{A}_i: =(A_i,\le_i,\top_i,\odot_i,\to_i,\bot_i)$, $i=1,2$ are two complete residuated multilattices, $G$ and $M$ two nonempty sets and $(\varphi, \psi)$ a Galois connection between $A_1^G$ and $A_2^M$ that is compatible with the residuation, then we show that \[\mathcal{C}: =\{(h,f)\in A_1^G\times A_2^M; \varphi(h)=f \text{ and } \psi(f)=h \}\] can be endowed with a complete residuated multilattice structure. This is a generalization of a result by Ruiz-Calvi{\~n}o and Medina saying that if the (reduct of the) algebras $\mathcal{A}_i$, $i=1,2$ are complete multilattices, then $\mathcal{C}$ is a complete multilattice. Comment: 21 pages, 6 figures
Blaise Blériot Koguep Njionou, Léonard Kwuida, Célestin Lélé
Fundam. Informaticae3
2022 (f, g)-derivation in residuated multilattices
Darline Laure Keubeng Yemene, Luc Eméry Diékouam Fotso, Célestin Lélé
Soft Comput.3
2021 On MV-coalgebras over the category of BL-algebras
Nganteu Tchikapa, Maurice Kianpi, Célestin Lélé
Soft Comput.3
2019 Multiplicative and implicative derivations on residuated multilattices
Line N. Maffeu, Célestin Lélé, Jean B. Nganou, Etienne Romuald Alomo Temgoua
Soft Comput.2
2017 Generalized Łukasiewicz rings
Albert Kadji, Célestin Lélé, Jean B. Nganou
Soft Comput.2
2017 Fuzzy prime and maximal filters of residuated lattices
Albert Kadji, Célestin Lélé, Marcel Tonga
Soft Comput.2
2013 MV-algebras derived from ideals in BL-algebras
Célestin Lélé, Jean B. Nganou
Fuzzy Sets Syst.1
2012 A New Characterization for n-Fold Positive Implicative BL-Logics
Esko Turunen, Nganteu Tchikapa, Célestin Lélé
IPMU (1)3
2012 n-Fold implicative basic logic is Gödel logic
Esko Turunen, Nganteu Tchikapa, Célestin Lélé
Soft Comput.3
2012 Erratum to: n-Fold implicative basic logic is Gödel logic
Esko Turunen, Nganteu Tchikapa, Célestin Lélé
Soft Comput.3
2008 Computational methods for study of foldness of H-ideals in BCI-algebras
Célestin Lélé, Salissou Moutari
Soft Comput.1