2026-05-27T04:42:20Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/263142026-02-03T11:22:28Zcom_10630_2254col_10630_37953

00925njm 22002777a 4500 dc Pérez-Gámez, Francisco author Cordero-Ortega, Pablo author Enciso-García-Oliveros, Manuel author Mora-Bonilla, Ángel author 2023 This paper aims to contribute to the extension of classical Formal Concept Analysis (FCA), allowing the management of unknown information. In a preliminary paper, we define a new kind of attribute implications to represent the knowledge from the information currently available. The whole FCA framework has to be appropriately extended to manage unknown information. This paper introduces a new logic for reasoning with this kind of implications, which belongs to the family of logics with an underlying Simplification paradigm. Specifically, we introduce a new algebra, named weak dual Heyting Algebra, that allows us to extend the Simplification logic for these new implications. To provide a solid framework, we also prove its soundness and completeness and show the advantages of the Simplification paradigm. Finally, to allow further use of this extension of FCA in applications, an algorithm for automated reasoning, which is directly built from logic, is defined. Pérez Gámez, Francisco & Cordero, Pablo & Enciso, Manuel & Mora-Bonilla, Angel. (2023). Simplification Logic for the management of unknown information. Information Sciences. 634. https://doi.org/10.1016/j.ins.2023.03.015. https://hdl.handle.net/10630/26314 https://doi.org/10.1016/j.ins.2023.03.015 Información-Gestión Simplification logic for the management of unknown information