RT Journal Article
T1 Simplification logic for the management of unknown information
A1 Pérez-Gámez, Francisco
A1 Cordero-Ortega, Pablo
A1 Enciso-García-Oliveros, Manuel
A1 Mora-Bonilla, Ángel
K1 Información-Gestión
AB 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.
PB Elsevier
YR 2023
FD 2023
LK https://hdl.handle.net/10630/26314
UL https://hdl.handle.net/10630/26314
LA eng
NO 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.
NO Funding for open access charge: Universidad de Málaga / CBUAThis article is Supported by Grants TIN2017-89023-P, PRE2018-085199 and PID2021-127870OB-I00 of the Ministry of Scienceand Innovation of Spain and UMA2018-FEDERJA-001 of the Junta de Andalucia and European Social Fund.
DS RIUMA. Repositorio Institucional de la Universidad de Málaga
RD 1 mar 2026