Parameterized simplification logic I: reasoning with implications and classes of closure operators

 

Abstract

In this paper, we present a general inference system for reasoning with if-then rules. They are defined using general lattice-theoretic notions and their semantics is defined using particular closure operators parameterized by systems of isotone Galois connections. In this general setting, we introduce a simplification logic, show its sound and complete axiomatization, and deal with related issues. The presented results can be seen as forming parameterized framework for dealing with if-then rules that allows to focus on particular dependencies obtained by choices of parameterizations.

Citation

Please, cite this work as:

[PV20] A. M. Pablo Cordero Manuel Enciso and V. Vychodil. “Parameterized simplification logic I: reasoning with implications and classes of closure operators”. In: International Journal of General Systems 49.7 (2020), pp. 724-746. DOI: 10.1080/03081079.2020.1831484. eprint:

https://doi.org/10.1080/03081079.2020.1831484

. URL: [

https://doi.org/10.1080/03081079.2020.1831484

](

https://doi.org/10.1080/03081079.2020.1831484

).

BibTeX

@article{doi:10.1080/03081079.2020.1831484,
    author = {Pablo Cordero, Manuel Enciso, Angel Mora and Vilem Vychodil},
    title = {Parameterized simplification logic I: reasoning with implications and classes of closure operators},
    journal = {International Journal of General Systems},
    volume = {49},
    number = {7},
    pages = {724-746},
    year = {2020},
    publisher = {Taylor & Francis},
    doi = {10.1080/03081079.2020.1831484},
    
    
    URL = {
    
     https://doi.org/10.1080/03081079.2020.1831484
    
    
    
    },
    eprint = {
    
     https://doi.org/10.1080/03081079.2020.1831484
    
    
    
    }
    
}