November 2025

Journal papers accepted FSS, COAM

N. Madrid, M. Ojeda-Aciego. Composition as a fuzzy conjunction between indexes of inclusions. Fuzzy Sets and Systems, Article 109685, 2026.
ABSTRACT We analyze the use of the composition of mappings as a fuzzy conjunction between indexes of inclusion. Instead of the general approach of the φ-index of inclusion, we consider a fresh approach that computes the φ-index of inclusion when restricted to a join-subsemilattice of indexes of inclusion. Under this restriction, we identify a certain join-subsemilattice which has a biresiduated structure when composition is interpreted as conjunction. The main consequence of this biresiduated structure is a representation theorem of biresiduated lattices on the unit interval in terms of the composition and subsets of indexes of inclusion.

H. Bello, P. Jiménez, C. Bejines. Examining fuzzy number approximation through a topological algebraic approach. Computational and Applied Mathematics 45, 81 (2026).
ABSTRACT In this paper, we delve into the study of fuzzy number approximation by LR fuzzy numbers, shedding light on their algebraic properties. We present a solid approach to approximate fuzzy numbers keeping the same expected interval and core proving that such approximation is additive and continuous under a wide family of distances. As a key part of this construction, we study the set of fuzzy numbers as a topological monoid and develop a process to embed any cancellative abelian topological monoid with open shifts in a topological abelian group. This allows us to demonstrate a highly useful result in the context of this paper: the continuity of homomorphisms between cancellative topological abelian monoids with open shifts is equivalent to its continuity at zero.
D. López-Rodríguez, M. Ojeda-Hernández, A. Mora, C. Bejines. Close-by-One-like algorithms in the fuzzy setting: Theory and experimentation. Fuzzy Sets and Systems 520, Article 109574, 2025.
ABSTRACT In Fuzzy Formal Concept Analysis (FFCA), concept lattices are computed by scaling the problem and applying ordinary FCA algorithms. In this paper, the CbO family of algorithms is extended to work natively in the fuzzy setting, they are proved to be correct and output the whole set of formal concepts, which makes them mathematically equivalent to the scaling approach.
However, experimental results demonstrate the performance improvement of these methods compared to scaling. The paper also discusses a new fuzzy strategy based on blacklisting redundant truth values to enhance the performance of algorithms by taking advantage of the structure of the residuated lattice.

Conference contributions accepted FSTA

O. Krídlo, M. Ojeda-Aciego. Generating Interpretable and User-elicited Fuzzy RDF Properties. Fuzzy Set Theory and Applications (FSTA), Liptovský Ján, Slovak Republic, 2026.

EXTENDED ABSTRACT

M. Ojeda-Hernández. Direct-optimal systems of attribute implications in fuzzy Formal Concept Analysis. Fuzzy Set Theory and Applications (FSTA), Liptovský Ján, Slovak Republic, 2026.

EXTENDED ABSTRACT