Formal Concepts and Residuation on Multilattices

DOI10.3233/FI-222147MaRDI QIDQ6094512FDO

Authors Blaise Bleriot Koguep Njionou, Léonard Kwuida, C. Lele

Publication date 14 September 2023

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.07415

zbMATH Keywords

formal concept analysismultilatticesresiduated multilatticesordinal sum of residuated multilatticessub-multilattices

Mathematics Subject Classification ID

Knowledge representation (68T30) Generalizations of lattices (06B75)

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 $$, $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 imes A_2^M; varphi(h)=f ext{ 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 $mathcalC$ is a complete multilattice.

Recommendations

• Fuzzy setting of residuated multilattices.
• Concept-forming operators on multilattices
• On basic conditions to generate multi-adjoint concept lattices via Galois connections.
• On the axioms of multistructures
• Ideals in multisemilattices and multilattices

Cites work

• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 2208113 (Why is no real title available?)
• Concept-forming operators on multilattices
• Decomposition of BL-chains
• Fuzzy logic programming via multilattices
• Fuzzy sets
• Fuzzy setting of residuated multilattices.
• L-fuzzy sets
• Lattice-based sum of t-norms on bounded lattices
• Lattice-based sums
• Metamathematics of fuzzy logic
• On residuation in multilattices: filters, congruences, and homomorphisms.
• On the Dedekind-MacNeille completion and formal concept analysis based on multilattices
• On the fundamentals of fuzzy set theory
• Partially ordered sets and the Schreier refinement theorem, II. Theory of multistructures
• The Blok-Ferreirim theorem for normal GBL-algebras and its application
• The logic of inexact concepts

Cited in

(1)

• On the Dedekind-MacNeille completion and formal concept analysis based on multilattices

This page was built for publication: Formal Concepts and Residuation on Multilattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094512)