Simplification logic for the management of unknown information

 

Abstract

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.

Citation

Please, cite this work as:

[Pér+23] F. Pérez-Gámez, P. Cordero, M. Enciso, et al. “Simplification logic for the management of unknown information”. In: Information Sciences 634 (2023), pp. 505-519. ISSN: 0020-0255. DOI: https://doi.org/10.1016/j.ins.2023.03.015. URL: https://www.sciencedirect.com/science/article/pii/S0020025523003110.

BibTeX

@article{PEREZGAMEZ2023505,
    title = {Simplification logic for the management of unknown information},
    journal = {Information Sciences},
    volume = {634},
    pages = {505-519},
    year = {2023},
    issn = {0020-0255},
    doi = {https://doi.org/10.1016/j.ins.2023.03.015},
    url = {https://www.sciencedirect.com/science/article/pii/S0020025523003110},
    author = {Francisco Pérez-Gámez and Pablo Cordero and Manuel Enciso and Ángel Mora},
    keywords = {Implications, Unknown information, Formal concept analysis, Simplification logic, Automated reasoning},
    abstract = {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.}
}