Towards Simplification Logic for Graded Attribute Implications with General Semantics

Authors
Published

1 January 2018

Publication details

Proceedings of the Fourteenth International Conference on Concept Lattices and Their Applications, {CLA} 2018, Olomouc, Czech Republic, June 12-14, 2018 , {CEUR} Workshop Proceedings vol. 2123, pages 129–140.

Links

 

Abstract

We present variant of simplification logic for reasoning with if-then dependencies that arise in formal concept analysis of data with graded attributes. The dependencies and the proposed logic are parameterized by systems of isotone Galois connections which allows us to handle a large family of possible interpretations of data dependencies. We describe semantics of the rules, axiomatic system of the logic, and prove its soundness and completeness.

Citation

Please, cite this work as:

[Cor+18] P. Cordero, M. Enciso, Á. Mora, et al. “Towards Simplification Logic for Graded Attribute Implications with General Semantics”. In: Proceedings of the Fourteenth International Conference on Concept Lattices and Their Applications, CLA 2018, Olomouc, Czech Republic, June 12-14, 2018. Ed. by D. I. Ignatov and L. Nourine. Vol. 2123. CEUR Workshop Proceedings. CEUR-WS.org, 2018, pp. 129-140. URL: https://ceur-ws.org/Vol-2123/paper11.pdf.

@InProceedings{Cordero2018,
     author = {Pablo Cordero and Manuel Enciso and {’A}ngel Mora and Vil{’e}m Vychodil},
     booktitle = {Proceedings of the Fourteenth International Conference on Concept Lattices and Their Applications, {CLA} 2018, Olomouc, Czech Republic, June 12-14, 2018},
     title = {Towards Simplification Logic for Graded Attribute Implications with General Semantics},
     year = {2018},
     editor = {Dmitry I. Ignatov and Lhouari Nourine},
     pages = {129–140},
     publisher = {CEUR-WS.org},
     series = {{CEUR} Workshop Proceedings},
     volume = {2123},
     abstract = {We present variant of simplification logic for reasoning with if-then dependencies that arise in formal concept analysis of data with
    graded attributes. The dependencies and the proposed logic are parameterized by systems of isotone Galois connections which allows us to handle a large family of possible interpretations of data dependencies. We describe semantics of the rules, axiomatic system of the logic, and prove its soundness and completeness.},
     bibsource = {dblp computer science bibliography, https://dblp.org},
     biburl = {https://dblp.org/rec/conf/cla/CorderoE0V18.bib},
     timestamp = {Fri, 10 Mar 2023 00:00:00 +0100},
     url = {https://ceur-ws.org/Vol-2123/paper11.pdf},
}