Attribute implications with unknown information based on weak Heyting algebras
Abstract
Simplification logic, a logic for attribute implications, was originally defined for Boolean sets. It was extended to distributive fuzzy sets by using a complete dual Heyting algebra. In this paper, we weaken this restriction in the sense that we prove that it is possible to define a simplification logic on fuzzy sets in which the membership value structure is not necessarily distributive. For this purpose, we replace the structure of the complete dual Heyting algebra by the so-called weak complete dual Heyting algebra. We demonstrate the soundness and completeness of this simplification logic, and provide a characterisation of the operations defining weak complete dual Heyting algebras.
Citation
Please, cite this work as:
[Cor+24] P. Cordero, M. Enciso, Á. Mora, et al. “Attribute implications with unknown information based on weak Heyting algebras”. In: Fuzzy Sets Syst. 490 (2024), p. 109026. DOI: 10.1016/J.FSS.2024.109026. URL: https://doi.org/10.1016/j.fss.2024.109026.
Bibliometric data
The following data has been extracted from resources such as OpenAlex, Dimensions, PlumX or Altmetric.
Cites
The following graph plots the number of cites received by this work from its publication, on a yearly basis.
Papers citing this work
The following is a non-exhaustive list of papers that cite this work:
[1] F. Pérez-Gámez and C. Bejines. “An exploration of weak Heyting algebras: Characterization and properties”. In: International Journal of Approximate Reasoning 179 (Apr. 2025), p. 109365. ISSN: 0888-613X. DOI: 10.1016/j.ijar.2025.109365. URL: http://dx.doi.org/10.1016/j.ijar.2025.109365.